The location-routing problem with simultaneous pickup and delivery: Formulations and a heuristic approach

In this paper, we consider a variant of the Location-Routing Problem (LRP), namely the LRP with simultaneous pickup and delivery (LRPSPD). The LRPSPD seeks to minimize total cost by simultaneously locating the depots and designing the vehicle routes that satisfy pickup and delivery demand of each cu...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Omega (Oxford) Ročník 40; číslo 4; s. 465 - 477
Hlavní autoři:	Karaoglan, Ismail, Altiparmak, Fulya, Kara, Imdat, Dengiz, Berna
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Kidlington Elsevier Ltd 01.08.2012 Elsevier Pergamon Press Inc
Edice:	Omega
Témata:	Applied sciences Deliveries Exact sciences and technology Ganzzahlige Optimierung Heuristic Heuristik Integer programming Linear programming Location-routing problem Location-routing problem Simultaneous pickup and delivery Mixed integer programming formulation Simulated annealing Logistics Mathematical programming Mixed integer programming formulation Operational research and scientific management Operational research. Management science Routing Simulated annealing Simulation Simultaneous pickup and delivery Studies Tourenplanung Transportproblem Location-routing problem Mixed integer programming formulation Simultaneous pickup and delivery Simulated annealing Lower bound Costs Mixed integer programming Routing Strong solution Modeling Location problem Computation time Supply demand balance Heuristic method Reverse logistics Localization Inequality
ISSN:	0305-0483, 1873-5274
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!