Multi-agent Pickup and Delivery Planning with Transfers. This was developed by Fred Glover and here are some critical papers that you will find referenced in most all VRP papers that use Tabu Search:. Here are a collection of links to papers that I found interesting. There are tons of papers on the web just google for the terms you are interested in:.
Ignore Learn more. Dismiss Document your code Every project on GitHub comes with a version-controlled wiki to give your documentation the high level of care it deserves. Sign up for free See pricing for teams and enterprises. In the real world there are many iterative solutions the give good results in reasonable run-times. We are open to others solvers but I would be good to discuss that on the dev list and explain the benefits of another algorithm so we can all learn from the discussion. Also has some benchmark data for testing. RinSim is a multi-agent system simulator written in Java.
It supports problems in the fields of transportation and logistics, most notably pickup-and-delivery problems PDP. Multi-agent Pickup and Delivery Planning with Transfers. This was developed by Fred Glover and here are some critical papers that you will find referenced in most all VRP papers that use Tabu Search:. From single path to vehicle routing: The retailer delivery approach.
[] An Improved Tabu Search Heuristic for Static Dial-A-Ride Problem
Exact solution for the vehicle routing problem with semi soft time windows and its application. An ant colony system ACS for vehicle routing problem with simultaneous delivery and pickup. Edge assembly-based memetic algorithm for the capacitated vehicle routing problem. A two-stage vehicle routing model for large-scale bioterrorism emergencies.
Jean-Yves Potvin ,. An exact solution approach for vehicle routing and scheduling problems with soft time windows. Optimizing goods assignment and the vehicle routing problem with time-dependent travel speeds. Adaptive granular local search heuristic for a dynamic vehicle routing problem.
An optimization approach for communal home meal delivery service: A case study. Multi-ant colony system MACS for a vehicle routing problem with backhauls. Heuristics are here to help your online vehicle scheduling. A well-scalable metaheuristic for the fleet size and mix vehicle routing problem with time windows. Time Petri nets as an evaluation tool for handling travel time uncertainty in vehicle routing solutions. Ant colony optimization for the two-dimensional loading vehicle routing problem. A tabu search approach to an urban transport problem in northern Spain.
A hybrid local improvement algorithm for large-scale multi-depot vehicle routing problems with time windows. The Mobile Mapping Van Problem: a matheuristic for capacitated arc routing with soft time windows and depot selection. The design of vehicle routes for a third-party logistics service provider using the simulated annealing algorithm. Optimal management of logistic activities in multi-site environments. Research for Dynamic vehicle routing problem with time windows in real city environment. Application of ant colony optimization to logistic scheduling algorithm.
A variable neighborhood search for the capacitated arc routing problem with intermediate facilities. Vehicle routing with soft time windows and Erlang travel times. A memetic algorithm for the vehicle routing problem with time windows.
TASTE: a two-phase heuristic to solve a routing problem with simultaneous delivery and pick-up. An iterated local search algorithm for the vehicle routing problem with convex time penalty functions. Genetic algorithm for the vehicle routing problem with time windows and fuzzy demand. Self-organizing maps in evolutionary approach for the traveling salesman problem and vehicle routing problem with time windows. An iterated local search algorithm for the time-dependent vehicle routing problem with time windows. A unified tabu search algorithm for vehicle routing problems with soft time windows.
Computational intelligence approach to real-world cooperative vehicle dispatching problem. Metaheuristics: A Canadian Perspective. Ant colony optimization for real-world vehicle routing problems. PSO-based algorithm for home care worker scheduling in the UK. A real-time vehicle-dispatching system for consolidating milk runs. Efficient evolutionary algorithm for the vehicle routing problem with time windows: edge assembly crossover for the VRPTW. An efficient variable neighborhood search heuristic for very large scale vehicle routing problems.
Scheduling trucks in local depots for door-to-door delivery services. Andrew Lim , Xingwen Zhang ,. Arc routing problems with time-dependent service costs. Scheduling periodic customer visits for a traveling salesperson. A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows. Optimizing the periodic pick-up of raw materials for a manufacturer of auto parts. Joint route planning under varying market conditions.
A goal programming approach to vehicle routing problems with soft time windows. A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: The case of job shop scheduling. A dial-a-ride problem for client transportation in a health-care organization.
A tabu-search heuristic for the vehicle routing problem with self-imposed time windows
A multi-parametric evolution strategies algorithm for vehicle routing problems. Chapter 6 Vehicle Routing. Physical distribution activities and vehicle routing problems in logistics management: A case study. Guided construction search metaheuristics for the capacitated p-median problem with single source constraint. Annotated bibliography in vehicle routing.
Main Article Content
Waste collection vehicle routing problem with time windows. The vehicle routing problem with flexible time windows and traveling times. A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem. A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems. Two approaches to solving the multi-depot vehicle routing problem with time windows in a time-based logistics environment.
Neighborhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries. Dynamic VRP in pharmaceutical distribution—a case study. Vehicle routing and scheduling with dynamic travel times. Combining constraint Propagation and meta-heuristics for searching a Maximum Weight Hamiltonian Chain.
- Information.
- VRP Algorithms · pgRouting/pgrouting Wiki · GitHub.
- Citações duplicadas.
- iowa counties assessor gis property search;
- divorce records for public view;