A variable neighborhood search heuristic algorithm for the double vehicle routing problem with multiple stacks
Published 2019 View Full Article
- Home
- Publications
- Publication Search
- Publication Details
Title
A variable neighborhood search heuristic algorithm for the double vehicle routing problem with multiple stacks
Authors
Keywords
-
Journal
International Transactions in Operational Research
Volume -, Issue -, Pages -
Publisher
Wiley
Online
2019-01-03
DOI
10.1111/itor.12623
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- Variable neighborhood search algorithms for the vehicle routing problem with two-dimensional loading constraints and mixed linehauls and backhauls
- (2018) Telmo Pinto et al. International Transactions in Operational Research
- Skewed general variable neighborhood search for the cumulative capacitated vehicle routing problem
- (2018) Noura Smiti et al. International Transactions in Operational Research
- Polyhedral results and a branch-and-cut algorithm for the double traveling Salesman problem with multiple stacks
- (2016) Michele Barbato et al. Discrete Optimization
- New formulation and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
- (2016) Afonso H. Sampaio et al. International Transactions in Operational Research
- Exact algorithms for the double vehicle routing problem with multiple stacks
- (2015) Manuel Iori et al. COMPUTERS & OPERATIONS RESEARCH
- A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints
- (2015) Lijun Wei et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- An Adaptive Variable Neighborhood Search for a Heterogeneous Fleet Vehicle Routing Problem with Three-Dimensional Loading Constraints
- (2014) Lijun Wei et al. IEEE Computational Intelligence Magazine
- A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
- (2012) Jean-François Côté et al. NETWORKS
- Efficient algorithms for the double traveling salesman problem with multiple stacks
- (2011) Marco Casazza et al. COMPUTERS & OPERATIONS RESEARCH
- Exact solutions to the double travelling salesman problem with multiple stacks
- (2010) Hanne L. Petersen et al. NETWORKS
- An exact method for the double TSP with multiple stacks
- (2010) Richard M. Lusby et al. International Transactions in Operational Research
- The double traveling salesman problem with multiple stacks: A variable neighborhood search approach
- (2009) Ángel Felipe et al. COMPUTERS & OPERATIONS RESEARCH
- A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
- (2009) Jean-François Cordeau et al. NETWORKS
- Heuristic and exact algorithms for the multi-pile vehicle routing problem
- (2009) Fabien Tricoire et al. OR SPECTRUM
- The double travelling salesman problem with multiple stacks – Formulation and heuristic solution approaches
- (2008) Hanne L. Petersen et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Find Funding. Review Successful Grants.
Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.
ExploreDiscover Peeref hubs
Discuss science. Find collaborators. Network.
Join a conversation