In The Field Of Combinatorial Optimization Problems, The Vehicle Routing Problem (vrp) Is One Of The Most Challenging. Defined More Than 40 Years Ago, The Problem Involves Designing The Optimal Set Of Routes For Fleets Of Vehicles For The Purpose Of Serving A Given Set Of Customers. Interest In Vrp
β¦ LIBER β¦
An intermodal multicommodity routing problem with scheduled services
β Scribed by Burak Ayar, Hande Yaman
- Book ID
- 118797837
- Publisher
- Springer US
- Year
- 2011
- Tongue
- English
- Weight
- 665 KB
- Volume
- 53
- Category
- Article
- ISSN
- 0926-6003
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The Vehicle Routing Problem || 13. Routi
β
Toth, Paolo; Vigo, Daniele
π
Article
π
2002
π
Society for Industrial and Applied Mathematics
π
English
β 186 KB
Adaptive large neighborhood search for s
β
Attila A. Kovacs, Sophie N. Parragh, Karl F. Doerner, Richard F. Hartl
π
Article
π
2011
π
Springer US
π
English
β 719 KB
Solving the Problem of Rerostering Nurse
β
Margarida Moz; Margarida Vaz Pato
π
Article
π
2004
π
Springer US
π
English
β 192 KB
Metric location problems with nonshortes
β
A. A. Ageev
π
Article
π
2008
π
Pleiades Publishing
π
English
β 538 KB
Modeling and solving a multimodal transp
β
Luigi Moccia; Jean-FranΓ§ois Cordeau; Gilbert Laporte; Stefan Ropke; Maria Pia Va
π
Article
π
2010
π
John Wiley and Sons
π
English
β 305 KB
This article studies a transportation problem in a multimodal network with shipment consolidation options. A freight forwarder can use a mix of flexible-time and scheduled transportation services. Time windows are a prominent aspect of the problem. For instance, they are used to model pickup and del
Metaheuristics for Production Scheduling
β
Jarboui, Bassem; Siarry, Patrick; Teghem, Jacques
π
Article
π
2013
π
John Wiley & Sons, Inc.
β 270 KB