A new optimization algorithm for the vehicle routing problem with time windows
Operations Research
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
A Generic Object-Oriented Constraint-Based Model for University Course Timetabling
PATAT '00 Selected papers from the Third International Conference on Practice and Theory of Automated Timetabling III
Constraint (Logic) Programming: A Survey on Research and Applications
Selected papers from the Joint ERCIM/Compulog Net Workshop on New Trends in Contraints
GVR: A New Genetic Representation for the Vehicle Routing Problem
AICS '02 Proceedings of the 13th Irish International Conference on Artificial Intelligence and Cognitive Science
A Hybrid Seachr Architecture Applied to Hard Random 3-SAT and Low-Autocorrelation Binary Sequences
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Local Probing Applied to Scheduling
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Preprocessing Expression-Based Constraint Satisfaction Problems for Stochastic Local Search
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Protein Structure Prediction with Large Neighborhood Constraint Programming Search
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Boosting VNS with Neighborhood Heuristics for Solving Constraint Optimization Problems
HM '08 Proceedings of the 5th International Workshop on Hybrid Metaheuristics
A Hybrid Algorithm for Vehicle Routing Problem with Time Windows
ISICA '08 Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence
Guided Ejection Search for the Job Shop Scheduling Problem
EvoCOP '09 Proceedings of the 9th European Conference on Evolutionary Computation in Combinatorial Optimization
Large Neighborhood Search Using Constraint Satisfaction Techniques in Vehicle Routing Problem
Canadian AI '09 Proceedings of the 22nd Canadian Conference on Artificial Intelligence: Advances in Artificial Intelligence
A New Approach to Improve the Ant Colony System Performance: Learning Levels
HAIS '09 Proceedings of the 4th International Conference on Hybrid Artificial Intelligence Systems
Parallel machine scheduling with precedence constraints and setup times
Computers and Operations Research
Advanced generic neighborhood heuristics for VNS
Engineering Applications of Artificial Intelligence
Scheduling technicians and tasks in a telecommunications company
Journal of Scheduling
Clp-based protein fragment assembly*
Theory and Practice of Logic Programming
INFORMS Journal on Computing
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Discrepancy-based sliced neighborhood search
AIMSA'10 Proceedings of the 14th international conference on Artificial intelligence: methodology, systems, and applications
Spatial, temporal, and hybrid decompositions for large-scale vehicle routing with time windows
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Parallel simulated annealing for the vehicle routing problem with time windows
EUROMICRO-PDP'02 Proceedings of the 10th Euromicro conference on Parallel, distributed and network-based processing
The capacitated vehicle routing problem with stochastic demands and time windows
Computers and Operations Research
Improving CP-based local branching via sliced neighborhood search
Proceedings of the 2011 ACM Symposium on Applied Computing
Hybrid metaheuristics in combinatorial optimization: A survey
Applied Soft Computing
An improved LNS algorithm for real-time vehicle routing problem with time windows
Computers and Operations Research
Large neighbourhood search algorithms for the founder sequence reconstruction problem
Computers and Operations Research
Local search heuristics for robotic routing planner
ISNN'11 Proceedings of the 8th international conference on Advances in neural networks - Volume Part III
Formulations and Branch-and-Cut Algorithms for the Generalized Vehicle Routing Problem
Transportation Science
Checking the Feasibility of Dial-a-Ride Instances Using Constraint Programming
Transportation Science
Localized genetic algorithm for vehicle routing problem with time windows
Applied Soft Computing
An adaptive large neighborhood search heuristic for a snow plowing problem with synchronized routes
INOC'11 Proceedings of the 5th international conference on Network optimization
Large neighborhood search for dial-a-ride problems
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Shipper decision support for the acceptance of bids during the procurement of transport services
ICCL'11 Proceedings of the Second international conference on Computational logistics
The pickup and delivery problem with cross-docking opportunity
ICCL'11 Proceedings of the Second international conference on Computational logistics
On Lattice Protein Structure Prediction Revisited
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
An effective local search approach for the Vehicle Routing Problem with Backhauls
Expert Systems with Applications: An International Journal
Genetic algorithm and large neighbourhood search to solve the cell formation problem
Expert Systems with Applications: An International Journal
Synchronized arc routing for snow plowing operations
Computers and Operations Research
A component language for hybrid solver cooperations
ADVIS'04 Proceedings of the Third international conference on Advances in Information Systems
Online stochastic and robust optimization
ASIAN'04 Proceedings of the 9th Asian Computing Science conference on Advances in Computer Science: dedicated to Jean-Louis Lassez on the Occasion of His 5th Cycle Birthday
Computers and Operations Research
Expert Systems with Applications: An International Journal
A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment
Computers and Operations Research
Nondeterministic control for hybrid search
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Invited contribution: hybrid CSP solving
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
Modelling an academic curriculum plan as a mixed-initiative constraint satisfaction problem
AI'05 Proceedings of the 18th Canadian Society conference on Advances in Artificial Intelligence
Towards self-organizing distribution structures for streaming media
ODBASE'06/OTM'06 Proceedings of the 2006 Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, DOA, GADA, and ODBASE - Volume Part II
Online stochastic reservation systems
CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Strategic planning for disaster recovery with stochastic last mile distribution
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Hybrid Adaptive Large Neighborhood Search for the Optimal Statistic Median Problem
Computers and Operations Research
Fast and high precision algorithms for optimization in large-scale genomic problems
Computational Biology and Chemistry
Iterated greedy algorithms for the maximal covering location problem
EvoCOP'12 Proceedings of the 12th European conference on Evolutionary Computation in Combinatorial Optimization
Exploring protein fragment assembly using CLP
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Bounding, filtering and diversification in CP-based local branching
Journal of Heuristics
A high level language for solver independent model manipulation and generation of hybrid solvers
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Simple temporal problems in route scheduling for the dial---a---ride problem with transfers
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Maximising the net present value for resource-constrained project scheduling
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Hybrid column generation and large neighborhood search for the dial-a-ride problem
Computers and Operations Research
Truck and trailer routing-Problems, heuristics and computational experience
Computers and Operations Research
A scalable sweep algorithm for the cumulative constraint
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
The consultation timetabling problem at Danish high schools
Journal of Heuristics
An Adaptive Large Neighborhood Search for the Pickup and Delivery Problem with Transfers
Transportation Science
An integrated search heuristic for large-scale flexible job shop scheduling problems
Computers and Operations Research
Plan quality optimisation via block decomposition
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Journal of Computational and Applied Mathematics
Expert Systems with Applications: An International Journal
UCC '13 Proceedings of the 2013 IEEE/ACM 6th International Conference on Utility and Cloud Computing
Variable and large neighborhood search to solve the multiobjective set covering problem
Journal of Heuristics
| Hi-index | 0.01 |
We use a local search method we term Large Neighbourhood Search (LNS) to solve vehicle routing problems. LNS is analogous to the shuffling technique of job-shop scheduling, and so meshes well with constraint programming technology. LNS explores a large neighbourhood of the current solution by selecting a number of "related" customer visits to remove from the set of planned routes, and re-inserting these visits using a constraint-based tree search. Unlike similar methods, we use Limited Discrepancy Search during the tree search to re-insert visits. We analyse the performance of our method on benchmark problems. We demonstrate that results produced are competitive with Operations Research meta-heuristic methods, indicating that constraint-based technology is directly applicable to vehicle routing problems.