A simulated annealing heuristic for the capacitated green vehicle routing problem

DOI10.1155/2019/2358258MaRDI QIDQ2298198zbMATH OpenOpenAlexWikidataFDO

Authors Nur Mayke Eka Normasari, Vincent F. Yu, Candra Bachtiyar, Sukoyo

Publication date 20 February 2020

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2019/2358258

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Review text

Summary: This research studies the capacitated green vehicle routing problem (CGVRP), which is an extension of the green vehicle routing problem (GVRP), characterized by the purpose of harmonizing environmental and economic costs by implementing effective routes to meet any environmental concerns while fulfilling customer demand. We formulate the mathematical model of the CGVRP and propose a simulated annealing (SA) heuristic for its solution in which the CGVRP is set up as a mixed integer linear program (MILP). The objective of the CGVRP is to minimize the total distance traveled by an alternative fuel vehicle (AFV). This research conducts a numerical experiment and sensitivity analysis. The results of the numerical experiment show that the SA algorithm is capable of obtaining good CGVRP solutions within a reasonable amount of time, and the sensitivity analysis demonstrates that the total distance is dependent on the number of customers and the vehicle driving range.

Recommendations

• A meta-heuristic for capacitated green vehicle routing problem
• A Green Vehicle Routing Problem with Multi-Depot, Multi-Tour, Heterogeneous Fleet and Split Deliveries: a mathematical model and heuristic approach
• A way to optimally solve a green time-dependent vehicle routing problem with time windows
• Enhanced multi-directional local search for the bi-objective heterogeneous vehicle routing problem with multiple driving ranges
• A genetic algorithm for a green vehicle routing problem

Cites work

• A guide to vehicle routing heuristics
• Development of a fuel consumption optimization model for the capacitated vehicle routing problem
• Energy Minimizing Vehicle Routing Problem
• Equation of state calculations by fast computing machines
• Improvement heuristics for the vehicle routing problem based on simulated annealing
• Optimization by simulated annealing
• The vehicle routing problem

Cited in

(6)

• Improvement heuristics for the vehicle routing problem based on simulated annealing
• A meta-heuristic for capacitated green vehicle routing problem
• Enhanced multi-directional local search for the bi-objective heterogeneous vehicle routing problem with multiple driving ranges
• A way to optimally solve a green time-dependent vehicle routing problem with time windows
• Distance-based adaptive large neighborhood search algorithm for green-PDPTW
• A theoretical and computational study of green vehicle routing problems

Describes a project that uses

Uses Software

• VRP

This page was built for publication: A simulated annealing heuristic for the capacitated green vehicle routing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2298198)