A Chance Constrained Goal Programming Model for Location-Routing Problem Under Uncertainty

Yang Liu (), Yun Yuan (), Yi Chen (), Lingxiao Ruan () and Hao Pang ()
Additional contact information
Yang Liu: Nanjing Agricultural University
Yun Yuan: Nanjing Agricultural University
Yi Chen: Nanjing Agricultural University
Lingxiao Ruan: Nanjing Agricultural University
Hao Pang: Nanjing Agricultural University

A chapter in LISS 2013, 2015, pp 105-116 from Springer

Abstract: Abstract This paper presents a new approach to model location-routing problem. Taking into account the priority level of decision making and random nature of costs and travel time, we extend the location-routing problem with distance constraints (LRP-DC) by adopting chance constrained goal programming approach to solve the uncertainty and to express the different levels of decisions. Meanwhile, a two-stage genetic algorithm incorporated with stochastic simulation is employed to solve the model with increased accuracy and efficiency. Computational experience is presented to illustrate the effectiveness of the solution procedure.

Keywords: Location routing; Logistics; Stochastic programming; Bi-level genetic algorithm (search for similar items in EconPapers)
Date: 2015
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-40660-7_15

Ordering information: This item can be ordered from
http://www.springer.com/9783642406607

DOI: 10.1007/978-3-642-40660-7_15

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().