File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Bilevel programming approach to optimizing a logistic distribution network with balancing requirements

TitleBilevel programming approach to optimizing a logistic distribution network with balancing requirements
Authors
Issue Date2004
Citation
Transportation Research Record, 2004, n. 1894, p. 188-197 How to Cite?
AbstractTraditional approaches to a location allocation problem have focused on the allocation of customers to a distribution center (DC) according to some arbitrary geographical boundaries (e.g., administrative zones and census districts), which usually incurs underuse or overcrowding of these centers. Location allocation with balancing requirements (e.g., balanced workload of service among DCs) has therefore been addressed. A distribution strategy with balanced-workload allocation aims to be cost-efficient and to improve customer service. A novel bilevel programming model is presented that minimizes the cost of the total distribution network and at the same time balances the workload of each DC for the delivery of products to its customers. A genetic algorithm-based approach was developed to cope with the bilevel model, and it was tested on a best realistic data set. In addition to the most cost-efficient design, the bilevel programming model presents a picture to decision makers that shows the trade-off between the objective of cost minimization and the balancing requirements. It is also shown that the bilevel model offers a flexible framework that allows the incorporation of more requirements and constraints if necessary.
Persistent Identifierhttp://hdl.handle.net/10722/330063
ISSN
2023 Impact Factor: 1.6
2023 SCImago Journal Rankings: 0.543

 

DC FieldValueLanguage
dc.contributor.authorHuang, Bo-
dc.contributor.authorLiu, Nan-
dc.date.accessioned2023-08-09T03:37:31Z-
dc.date.available2023-08-09T03:37:31Z-
dc.date.issued2004-
dc.identifier.citationTransportation Research Record, 2004, n. 1894, p. 188-197-
dc.identifier.issn0361-1981-
dc.identifier.urihttp://hdl.handle.net/10722/330063-
dc.description.abstractTraditional approaches to a location allocation problem have focused on the allocation of customers to a distribution center (DC) according to some arbitrary geographical boundaries (e.g., administrative zones and census districts), which usually incurs underuse or overcrowding of these centers. Location allocation with balancing requirements (e.g., balanced workload of service among DCs) has therefore been addressed. A distribution strategy with balanced-workload allocation aims to be cost-efficient and to improve customer service. A novel bilevel programming model is presented that minimizes the cost of the total distribution network and at the same time balances the workload of each DC for the delivery of products to its customers. A genetic algorithm-based approach was developed to cope with the bilevel model, and it was tested on a best realistic data set. In addition to the most cost-efficient design, the bilevel programming model presents a picture to decision makers that shows the trade-off between the objective of cost minimization and the balancing requirements. It is also shown that the bilevel model offers a flexible framework that allows the incorporation of more requirements and constraints if necessary.-
dc.languageeng-
dc.relation.ispartofTransportation Research Record-
dc.titleBilevel programming approach to optimizing a logistic distribution network with balancing requirements-
dc.typeConference_Paper-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.3141/1894-20-
dc.identifier.scopuseid_2-s2.0-19944366282-
dc.identifier.issue1894-
dc.identifier.spage188-
dc.identifier.epage197-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats