Vehicle routing problem for multiple product types, compartments, and trips with soft time windows

DOI10.1155/2015/126754zbMath1457.90013OpenAlexW1581107663WikidataQ59109783 ScholiaQ59109783MaRDI QIDQ1751334

P. Kabcome, T. Mouktonglang

Publication date: 25 May 2018

Published in: International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2015/126754

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

Product-oriented time window assignment for a multi-compartment vehicle routing problem ⋮ Multi-compartment vehicle routing problems: state-of-the-art, modeling framework and future directions

Uses Software

• AIMMS
• VRP

Cites Work

• Vehicle routing with compartments: applications, modelling and heuristics
• Adaptive memory programming for the vehicle routing problem with multiple trips
• A multi-phase constructive heuristic for the vehicle routing problem with multiple trips.
• Efficient heuristics for the heterogeneous fleet multitrip VRP with application to a large-scale real case
• A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem
• The Truck Dispatching Problem
• The Vehicle Routing Problem
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
• An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation
• A guide to vehicle routing heuristics
• A greedy look-ahead heuristic for the vehicle routing problem with time windows
• A unified tabu search heuristic for vehicle routing problems with time windows
• Simple Heuristics for the Vehicle Routeing Problem with Soft Time Windows
• Two Evolutionary Metaheuristics For The Vehicle Routing Problem With Time Windows
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Vehicle routing problem for multiple product types, compartments, and trips with soft time windows