This paper presents a new multi-depot combined vehicle and crew scheduling algorithm, and uses it, in conjunction with a heuristic vehicle routing algorithm, to solve the intra-city mail distribution problem faced by Australia Post. First we describe the Australia Post mail distribution problem and outline the heuristic vehicle routing algorithm used to find vehicle routes. We present a new mul...

The Multi-Depot Vehicle Routing Problem (MDVRP) is a generalization of SDVRP, in which multiple vehicles start from multiple depots and return to their original depots at the end of their assigned tours. The MDVRP is NP-hard, therefore, the development of heuristic algorithms for this problem class is of primary interest. This paper solves Multi-Depot Vehicle Routing Problem with Cellular Ant A...

The multi-depot fleet size and mix vehicle routing problem, also known as the multi-depot routing with heterogeneous vehicles, is investigated. A mathematical formulation is given and lower as well as upper bounds are produced using a three hour execution time of CPLEX. An efficient implementation of variable neighborhood search that incorporates new features in addition to the adaptation of se...

The driver scheduling problem at Chinese electric multiple-unit train depots becomes more and difficult in practice is studied very little research. This paper focuses on defining, modeling, solving the depot which can determine size schedule simultaneously. To solve this problem, we first construct a time-space network based formulate as minimum-cost multi-commodity flow problem. We then devel...

The Capacitated Location-Routing Problem (CLRP) is a NP-hard problem since it generalizes two well known NP-hard problems: the Capacitated Facility Location Problem (CFLP) and the Capacitated Vehicle Routing Problem (CVRP). The Multi-Depot Vehicle Routing Problem (MDVRP) is known to be a NP-hard since it is a generalization of the well known Vehicle Routing Problem (VRP), arising with one depot...

This paper considers a multi-depot heterogeneous vehicle routing problem (MDHVRP) with time windows, which is very crucial for hazardous materials transportation. For this reason, we formalize as multi-objective MDHVRP optimization model, where the actual load dependent risk of transportation considered. To solve problem, propose hybrid evolutionary algorithm (HMOEA) and two-stage (TSA). In add...

Multi-depot routing problems arise in distribution logistics where a set of vehicles based at several depots are used to serve a number of clients. Most variants of this problem have the basic requirement that the route of each vehicle starts and ends at the same depot. This paper describes new inequalities, namely multicut constraints (MCC), that enforce this requirement in mathematical progra...

The present work aims to support tactical and operational planning decisions of reverse logistics systems while considering economic, environmental and social objectives. In the literature, when addressing such systems economic aspects have been often used, while environmental concerns have emerged only recently. The social component is the one less studied and rarely the combination of the thr...

This paper introduces cooperative games arising from multi-depot Chinese postman problems and explores the properties of these games. A multi-depot Chinese postman problem (MDCP) is represented by a connected (di)graph G, a set of k depots that is a subset of the vertices of G, and a non-negative weight function on the edges of G. A solution to the MDCP is a minimum weight tour of the (di)graph...