Journal ArticleDOI
Separating capacity constraints in the CVRP using tabu search
Reads0
Chats0
TLDR
Three algorithms are presented: a constructive algorithm, a randomized greedy algorithm and a very simple tabu search procedure used in a Branch and Cut procedure that successfully solved to optimality large CVRP instances.About:
This article is published in European Journal of Operational Research.The article was published on 1998-04-16. It has received 162 citations till now. The article focuses on the topics: Tabu search & Branch and cut.read more
Citations
More filters
Book
Metaheuristics: From Design to Implementation
TL;DR: This book provides a complete background on metaheuristics and shows readers how to design and implement efficient algorithms to solve complex optimization problems across a diverse range of applications, from networking and bioinformatics to engineering design, routing, and scheduling.
Journal ArticleDOI
A new branch-and-cut algorithm for the capacitated vehicle routing problem
TL;DR: A new branch-and-cut algorithm for the capacitated vehicle routing problem (CVRP) that uses a variety of cutting planes, including capacity, framed capacity, generalized capacity, strengthened comb, multistar, partialMultistar, extended hypotour inequalities, and classical Gomory mixed-integer cuts is presented.
Journal ArticleDOI
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
TL;DR: A mixed-integer programming formulation of the dial-a-ride problem and a branch-and-cut algorithm used for the traveling salesman, the vehicle routing, and the pick-up and delivery problems are introduced.
Journal ArticleDOI
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem
Ricardo Fukasawa,Humberto J. Longo,Jens Lysgaard,Marcus Poggi de Aragão,Marcelo L. Reis,Eduardo Uchoa,Renato F. Werneck +6 more
TL;DR: This paper presents an algorithm that combines both approaches: it works over the intersection of two polytopes, one associated with a traditional Lagrangean relaxation over q-routes, the other defined by bound, degree and capacity constraints.
Journal ArticleDOI
Bike sharing systems: Solving the static rebalancing problem
TL;DR: Efficient algorithms for solving instances of reasonable size and the possibility of using the information provided by the relaxation receives a special attention, both from a theoretical and a practical point of view are presented.
References
More filters
Journal ArticleDOI
Tabu Search—Part II
TL;DR: The elements of staged search and structured move sets are characterized, which bear on the issue of finiteness, and new dynamic strategies for managing tabu lists are introduced, allowing fuller exploitation of underlying evaluation functions.
Journal ArticleDOI
TSPLIB—A Traveling Salesman Problem Library
TL;DR: This paper contains the description of a traveling salesman problem library (TSPLIB) which is meant to provide researchers with a broad set of test problems from various sources and with various properties.
Book
The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization
TL;DR: In this paper, Johnson and Papadimitriou proposed a performance guarantee for heuristics, based on the notion of well-solved special cases (P. Gilmore, et al.).
Journal ArticleDOI
A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems
Manfred Padberg,Giovanni Rinaldi +1 more
TL;DR: An algorithm is described for solving large-scale instances of the Symmetric Traveling Salesman Problem (STSP) to optimality using a “polyhedral” cutting-plane procedure that exploits a subset of the system of linear inequalities defining the convex hull of the incidence vectors of the hamiltonian cycles of a complete graph.