Journal ArticleDOI
Open vehicle routing problem with cross-docking
TLDR
A simulated annealing (SA) algorithm that incorporates several neighborhood structures to improve the performance on solving OVRPCD and outperforms existing approaches for vehicle routing problem with cross-docking.About:
This article is published in Computers & Industrial Engineering.The article was published on 2016-04-01. It has received 96 citations till now. The article focuses on the topics: Vehicle routing problem & Simulated annealing.read more
Citations
More filters
Journal ArticleDOI
A simulated annealing heuristic for the hybrid vehicle routing problem
TL;DR: A simulated annealing (SA) heuristic is proposed to solve the hybrid vehicle routing problem (HVRP), which is an extension of the Green Vehicle Routing Problem (G-VRP) and results show that the proposed SA effectively solves HVRP.
Journal ArticleDOI
Multi-Objective Optimization for the Reliable Pollution-Routing Problem with Cross-Dock Selection using Pareto-based Algorithms
Erfan Babaee Tirkolaee,Alireza Goli,Amin Faridnia,Mehdi Soltani,Gerhard-Wilhelm Weber,Gerhard-Wilhelm Weber +5 more
TL;DR: It is concluded that the solution techniques can yield high-quality solutions and NSGA-II is considered as the most efficient solution tool, the optimal route planning of the case study problem in delivery and pick-up phases is attained using the best-found Pareto solution and the highest change in the objective function occurs for the total cost value by applying a 20% increase in the demand parameter.
Journal ArticleDOI
Composite particle algorithm for sustainable integrated dynamic ship routing and scheduling optimization
Arijit De,Vamsee Krishna Mamanduru,Angappa Gunasekaran,Nachiappan Subramanian,Manoj Kumar Tiwari +4 more
TL;DR: Results suggest that the carbon emission, fuel cost and fuel consumption constraints can be comfortably added to the mathematical model for encapsulating the sustainability dimensions.
Journal ArticleDOI
Symbiotic organisms search and two solution representations for solving the capacitated vehicle routing problem
TL;DR: This paper develops six versions of SOS, a simple and powerful metaheuristic that simulates the symbiotic interaction strategies adopted by an organism for surviving in an ecosystem, for solving the capacitated vehicle routing problem (CVRP).
Journal ArticleDOI
Modified variable neighborhood search and genetic algorithm for profitable heterogeneous vehicle routing problem with cross-docking
Ali Baniamerian,Mahdi Bashiri,Reza Tavakkoli-Moghaddam,Reza Tavakkoli-Moghaddam,Reza Tavakkoli-Moghaddam +4 more
TL;DR: A new hybrid meta-heuristic algorithm based on modified variable neighborhood search with four shaking and two neighborhood structures and a genetic algorithm is presented to solve large-sized problems and reveals that in the small-size test problems, the hybrid algorithm is able to find optimal solutions in an acceptable computational time.
References
More filters
Journal ArticleDOI
Equation of state calculations by fast computing machines
TL;DR: In this article, a modified Monte Carlo integration over configuration space is used to investigate the properties of a two-dimensional rigid-sphere system with a set of interacting individual molecules, and the results are compared to free volume equations of state and a four-term virial coefficient expansion.
Journal ArticleDOI
A general heuristic for vehicle routing problems
David Pisinger,Stefan Ropke +1 more
TL;DR: A unified heuristic which is able to solve five different variants of the vehicle routing problem and shown promising results for a large class of vehicle routing problems with backhauls as demonstrated in Ropke and Pisinger.
A tabu search heuristic for the vehicle routing problem
TL;DR: Taburoute as mentioned in this paper is a new tabu search heuristic for the vehicle routing problem with capacity and route length restrictions, which considers a sequence of adjacent solutions obtained by repeatedly removing a vertex from its current route, and reinserting it into another route.
Journal ArticleDOI
A tabu search heuristic for the vehicle routing problem
TL;DR: Numerical tests on a set of benchmark problems indicate that tabu search outperforms the best existing heuristics, and TABUROUTE often produces the bes known solutions.
Journal ArticleDOI
The vehicle routing problem
TL;DR: This classification is the first to categorize the articles of the VRP literature to this level of detail and is based on an adapted version of an existing comprehensive taxonomy.