Show simple item record  

dc.contributor.authorBasnet, Chuda
dc.contributor.authorWeintraub, Andres
dc.date.accessioned2009-10-19T01:25:20Z
dc.date.available2009-10-19T01:25:20Z
dc.date.issued2009
dc.identifier.citationBasnet, C. & Weintraub, A. (2009). A genetic algorithm for a bicriteria supplier selection problem. International Transactions in Operational Research, 16(2), 173-187.en
dc.identifier.urihttps://hdl.handle.net/10289/3292
dc.description.abstractIn this paper, we discuss the problem of selecting suppliers for an organisation, where a number of suppliers have made price offers for supply of items, but have limited capacity. Selecting the cheapest combination of suppliers is a straightforward matter, but purchasers often have a dual goal of lowering the number of suppliers they deal with. This second goal makes this issue a bicriteria problem – minimisation of cost and minimisation of the number of suppliers. We present a mixed integer programming (MIP) model for this scenario. Quality and delivery performance are modelled as constraints. Smaller instances of this model may be solved using an MIP solver, but large instances will require a heuristic. We present a multi-population genetic algorithm for generating Pareto-optimal solutions of the problem. The performance of this algorithm is compared against MIP solutions and Monte Carlo solutions.en
dc.language.isoen
dc.publisherWiley-Blackwell Publishing Ltden_NZ
dc.relation.urihttp://www3.interscience.wiley.com/journal/122212333/abstracten
dc.subjectsupplier selectionen
dc.subjectsupplier rationalisationen
dc.subjectbicriteria optimisationen
dc.subjectgenetic algorithmen
dc.titleA genetic algorithm for a bicriteria supplier selection problemen
dc.typeJournal Articleen
dc.identifier.doi10.1111/j.1475-3995.2009.00680.xen
dc.relation.isPartOfInternational Transactions in Operational Researchen_NZ
pubs.begin-page173en_NZ
pubs.elements-id34452
pubs.end-page187en_NZ
pubs.issue2en_NZ
pubs.volume16en_NZ


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record