The Multi-Depot Minimum Latency Problem with Inter-Depot Routes
نویسنده
چکیده
ID: I935 Timothy W. Duket and Seokcheon Lee School of Industrial Engineering, Purdue University West Lafayette, IN 47906
منابع مشابه
The fuzzy multi-depot vehicle routing problem with simultaneous pickup and delivery: Formulation and a heuristic algorithm
In this paper, the fuzzy multi-depot vehicle routing problem with simultaneous pickup and delivery (FMDVRP-SPD) is investigated. The FMDVRP-SPD is the problem of allocating customers to several depots, so that the optimal set of routes is determined simultaneously to serve the pickup and the delivery demands of each customer within scattered depots. In the problem, both pickup and delivery dema...
متن کاملA Two-Phase Hybrid Heuristic Method for a Multi-Depot Inventory-Routing Problem
In this study, a two phase hybrid heuristic approach was proposed to solve the multi-depot multi-vehicle inventory routing problem (MDMVIRP). Inventory routing problem (IRP) is one of the major issues in the supply chain networks that arise in the context of vendor managed systems (VMI) The MDMVIRP combines inventory management and routing decision. We are given on input a fleet of homogeneous ...
متن کاملDevelopment of Model and Algorithm for Depot Balancing Multi-Depot Vehicle Scheduling Problem Considering Depot Balancing
The main of multi-depot vehicle scheduling problem (MDVSP) is to schedule the timetabled trips using limited resources, optimally. The problem is very important in the management of the transportation systems. One of the most useful ways to better manage these systems is to consider the real conditions including depot balancing constraints. To normalize the number of vehicles departed from each...
متن کاملNew Heuristic Algorithms for Solving Single-Vehicle and Multi-Vehicle Generalized Traveling Salesman Problems (GTSP)
Among numerous NP-hard problems, the Traveling Salesman Problem (TSP) has been one of the most explored, yet unknown one. Even a minor modification changes the problem’s status, calling for a different solution. The Generalized Traveling Salesman Problem (GTSP)expands the TSP to a much more complicated form, replacing single nodes with a group or cluster of nodes, where the objective is to fi...
متن کاملThe Multi-Depot Vehicle Routing Problem with Inter-Depot Routes
This article addresses an extension of the multi-depot vehicle routing problem in which vehicles may be replenished at intermediate depots along their route. It proposes a heuristic combining the adaptative memory principle, a tabu search method for the solution of subproblems, and integer programming. Tests are conducted on randomly generated instances.
متن کامل