GRASP/VND with Path Relinking for the Truck and Trailer Routing Problem
نویسندگان
چکیده
منابع مشابه
A Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کاملHeuristic column generation for the truck and trailer routing problem ⋆
We present a heuristic column generation for the truck and trailer routing problem (TTRP) in which the routes of the local optima of a GRASP/VNS are used as columns of a set-partitioning formulation of the TTRP. This approach outperforms the previous state-of-the-art methods and improves the best-known solutions for several test instances from the literature.
متن کاملGRASP with Path Relinking for the Two-Echelon Vehicle Routing Problem
We propose a meta-heuristic based on GRASP combined with Path Relinking to address the Two-Echelon Vehicle Routing Problem, an extension of the Capacitated Vehicle Routing Problem in which the delivery from a single depot to customers is achieved by routing and consolidating the freight through intermediate depots called satellites. The problem is treated by separating the depot-to-satellite tr...
متن کاملRestart strategies for GRASP with path-relinking heuristics
GRASP with path-relinking is a hybrid metaheuristic, or stochastic local search (Monte Carlo) method, for combinatorial optimization. A restart strategy in GRASP with path-relinking heuristics is a set of iterations {i1, i2, . . .} on which the heuristic is restarted from scratch using a new seed for the random number generator. Restart strategies have been shown to speed up stochastic local se...
متن کاملGRASP/Evolutionary Local Search Hybrids for a Truck and Trailer Routing Problem
The vehicle routing problem (VRP) aims to find a set of routes of minimum total length to serve the demand of a set of customers using a fleet of capacitated vehicles based at a central depot [6]. In this work we present a new extension of the VRP, the single truck and trailer routing problem with satellite depots (STTRPSD). To solve the STTRPSD we developed a hybrid metaheuristic based on gree...
متن کامل