Optimal solution of a total time distribution problem (original) (raw)

Network design for time-constrained delivery using subgraphs

Computational Management Science, 2012

Delivery companies are offering an increasing number of time-definite services. Yet, little research has been done that explores the design of delivery networks and accounts for these time-definite services. In this paper, we explore such design problems for net-works with a specified ...

Solving delivery problems in distribution systems

Logistics and Transport, 2013

The subject matter of this article is the optimization of delivery problems (Vehicle Routing Problems – VRP) with regard to distribution systems. These issues belong to the class of NP-hard problems. Current solutions to various delivery problems (VRP, TSP, MTSP, VRPTW, RDPTW) were analysed. Two examples were presented. In a transport and production task, a marginal cost equalling (MCE) algorithm was used. In the case of a Multi Depot Vehicle Routing Problem (MDVRP), an evolutionary algorithm was used.