People | Locations | Statistics |
---|---|---|
Ziakopoulos, Apostolos | Athens |
|
Vigliani, Alessandro | Turin |
|
Catani, Jacopo | Rome |
|
Statheros, Thomas | Stevenage |
|
Utriainen, Roni | Tampere |
|
Guglieri, Giorgio | Turin |
|
Martínez Sánchez, Joaquín |
| |
Tobolar, Jakub |
| |
Volodarets, M. |
| |
Piwowar, Piotr |
| |
Tennoy, Aud | Oslo |
|
Matos, Ana Rita |
| |
Cicevic, Svetlana |
| |
Sommer, Carsten | Kassel |
|
Liu, Meiqi |
| |
Pirdavani, Ali | Hasselt |
|
Niklaß, Malte |
| |
Lima, Pedro | Braga |
|
Turunen, Anu W. |
| |
Antunes, Carlos Henggeler |
| |
Krasnov, Oleg A. |
| |
Lopes, Joao P. |
| |
Turan, Osman |
| |
Lučanin, Vojkan | Belgrade |
|
Tanaskovic, Jovan |
|
Braysy, Olli
in Cooperation with on an Cooperation-Score of 37%
Topics
- vehicle
- algorithm
- time window
- hill
- assessment
- customer
- survey
- optimisation
- routing
- vehicle fleet
- logistics
- travel
- travel time
- multiple use
- software
- intermodal transportation
- benchmark
- industry
- planning
- noise
- estimate
- safety
- crash
- estimating
- market
- business administration
- ground traffic
- accounting
- contracting out
- industry structure
- management information system
- logistics service provider
- evolution
- show 3 more
Publications (10/10 displayed)
- 2018Why to climb if one can jump
- 2016A Survey of Heuristics for the Vehicle Routing Problem Part I: Basic Problems and Supply Side Extensions
- 2014Chapter 12: Software Tools and Emerging Technologies for Vehicle Routing and Intermodal Transportationcitations
- 2010A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windowscitations
- 2009A well-scalable metaheuristic for the fleet size and mix vehicle routing problem with time windowscitations
- 2007Joint route planning under varying market conditionscitations
- 2007A multi-parametric evolution strategies algorithm for vehicle routing problemscitations
- 2004A multi-start local search algorithm for the vehicle routing problem with time windowscitations
- 2003A Threshold Accepting Metaheuristic for the Vehicle Routing Problem with Time Windowscitations
- 2003A Fast Evolutionary Metaheuristic for the Vehicle Routing Problem with Time Windowscitations
Places of action
document
Joint route planning under varying market conditions
Abstract
Purpose - To provide empirical evidence on the level of savings that can be attained by joint route planning and how these savings depend on specific market characteristics. Design/methodology/approach - Joint route planning is a measure that companies can take to decrease the costs of their distribution activities. Essentially, this can either be achieved through horizontal cooperation or through outsourcing distribution to a logistics service provider. The synergy value is defined as the difference between distribution costs in the original situation where all entities perform their orders individually, and the costs of a system where all orders are collected and route schemes are set up simultaneously to exploit economies of scale. This paper provides estimates of synergy values, both in a constructed benchmark case and in a number of real-world cases. Findings - It turns out that synergy values of 30 per cent are achievable. Furthermore, intuition is developed on how the synergy values depend on characteristics of the distribution problem under consideration. Practical implications - The developed intuition on the nature of synergy values can help practitioners to find suitable combinations of distribution systems, since synergy values can quickly be assessed based on the characteristics of the distribution problem, without solving large and difficult vehicle routing problems. Originality/value - This paper addresses a major impediment to horizontal cooperation: estimating operational savings upfront.
Topics
Search in FID move catalog