نتایج جستجو برای: capacitated location routing problem

تعداد نتایج: 1118891  

2012
Christophe Duhamel Caroline Prodhon

Split procedures have been proved to be efficient within global framework optimization for routing problems by splitting giant tour into trips. This is done by generating optimal shortest path within an auxiliary graph built from the giant tour. An efficient application has been introduced for the first time by Lacomme et al. (2001) within a metaheuristic approach to solve the Capacitated Arc R...

2016
S. Raghavan Mustafa Sahin

The capacitated mobile facility location problem (CMFLP) arises in logistics planning of community outreach programs delivered via mobile facilities. It adds capacity restrictions to the mobile facility location problem introduced previously by Demaine et al. [2009], thereby extending the problem to a practical setting. In the problem, one seeks to relocate (or move) a set of existing facilitie...

2012
Claudio Contardo Vera C. Hemmelmayr Teodor Gabriel Crainic

In this paper, we introduce two algorithms to address the two-echelon capacitated location-routing problem (2E-CLRP). We introduce a branch-and-cut algorithm based on the solution of a new two-index vehicle-flow formulation, which is strengthened with several families of valid inequalities. We also propose an adaptive large-neighbourhood search (ALNS) meta-heuristic with the objective of findin...

Journal: :IOP Conference Series: Materials Science and Engineering 2015

Journal: : 2022

This paper focuses on the capacitated vehicle routing problem (CVRP), which is a challenging optimization faced by logistics companies. The objective of CVRP to determine optimal fleet vehicles deliver goods set customers, subject various constraints such as capacity and distance. can lead significant cost savings for companies, why it has received lot attention from researchers practitioners. ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید