Multi-objective iterated greedy variable neighborhood search algorithm for solving a full-load automated guided vehicle routing problem with battery constraints

DOI10.1016/J.ENDM.2014.11.022zbMath1362.90078OpenAlexW2037820192MaRDI QIDQ2631250

Olfa Chebbi, Jouhaina Siala Chaouachi

Publication date: 29 July 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2014.11.022

zbMATH Keywords

variable neighborhood searchpersonal rapid transitmulti-objectiveiterated greedy

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
• Variable neighborhood search: Principles and applications

This page was built for publication: Multi-objective iterated greedy variable neighborhood search algorithm for solving a full-load automated guided vehicle routing problem with battery constraints