A Meta-heuristic Applied for a Topologic Pickup and Delivery Problem with Time Windows Constraints

  title={A Meta-heuristic Applied for a Topologic Pickup and Delivery Problem with Time Windows Constraints},
  author={Jes{\'u}s Fabi{\'a}n L{\'o}pez P{\'e}rez},
  booktitle={International Conference on Conceptual Structures},
Our problem is about a routing of a vehicle with product pickup and delivery and with time window constraints. [] Key Result We report good solutions in computational times below 5 minutes.



Pickup and Delivery of Partial Loads with “Soft” Time Windows

An exact algorithm is described which exploits the structure of the single-vehicle routing and scheduling problem with time windows, partial loads, and dwell times, and a route improvement heuristic is constructed based on the master problem.

Variable-Depth Search for the Single-Vehicle Pickup and Delivery Problem with Time Windows

A local search method for this problem based on a variable-depth search, similar to the Lin-Kernighan algorithm for the traveling salesman problem, which is shown to produce near-optimal solutions in a reasonable amount of computation time.

Solving the Asymmetric Travelling Salesman Problem with time windows by branch-and-cut

Computational results for real-world instances with up to 233 nodes are reported, showing that a new model presented in a companion paper outperforms the other two models considered – at least for a special application – and that the heuristics provide acceptable solutions.

A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows

This paper presents a new optimization algorithm capable of optimally solving 100-customer problems of the vehicle routing problem with time windows VRPTW and indicates that this algorithm proved to be successful on a variety of practical sized benchmark VRPTw test problems.

Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling

A heuristic routing and scheduling algorithm is shown to produce high quality solutions in reasonable computation time by testing on moderately sized real data bases from both Gaithers-burg, Maryland, and Baltimore, Maryland.

A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints

This article considers a variant of the classical asymmetric traveling salesman problem (ATSP), namely the ATSP in which precedence constraints require that certain nodes must precede certain other nodes in any feasible directed tour, and describes in detail the implementation of a branch&cut-algorithm.

A polyhedral approach to the delivery man problem

We propose a mixed integer programming formulation for the delivery man problem and derive additional classes of valid inequalities Computational results are presented for instances of the delivery

An Optimal Algorithm for the Traveling Salesman Problem with Time Windows

New elimination tests are presented which greatly enhance the performance of a relatively well established dynamic programming approach and its application to the minimization of the total traveling cost for the traveling salesman problem with time windows.

An Exact Algorithm for the Single Vehicle Many-to-Many Dial-A-Ride Problem with Time Windows

This paper modifies the exact Dynamic Programming algorithm developed by the author for the single vehicle many-to-many immediate request Dial-A-Ride problem to solve the problem where each customer