loading
Papers

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Hadhami Kaabi 1 and Khaled Jabeur 2

Affiliations: 1 Institut Supérieur de Gestion, Tunisia ; 2 Institut Supérieur de Commerce et de Comptabilité, Tunisia

ISBN: 978-989-758-122-9

Keyword(s): Multi-compartment, Vehicle Routing, Time Windows, Profit, Genetic Algorithm, Iterated Local Search.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; Computational Intelligence ; Evolutionary Computing ; Genetic Algorithms ; Industrial Engineering ; Informatics in Control, Automation and Robotics ; Intelligent Control Systems and Optimization ; Optimization Algorithms ; Production Planning, Scheduling and Control ; Soft Computing ; Supply Chain and Logistics Engineering

Abstract: This paper presents a new variant of the well-known vehicle routing problem with time windows (VRPTW). More precisely, this paper addresses a multi-compartment vehicle routing problem with time windows and profit (MCVRPTW with profit). The aim of this problem is to serve a set of customers by using a set of vehicles with multiple compartments, under a minimum traveling cost. The vehicles, starting and ending at the depot, have a limited capacity and each compartment is dedicated to one product. A customer is served only within a given time windows and, when it is visited a profit is collected (i.e. a profit not low than a preset profit bound). To solve this problem, an hybrid approach combining the genetic algorithm (GA) and the iterated local search (ILS) is used.

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 35.173.234.140

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Kaabi, H. and Jabeur, K. (2015). Hybrid Algorithm for Solving the Multi-compartment Vehicle Routing Problem with Time Windows and Profit.In Proceedings of the 12th International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO, ISBN 978-989-758-122-9, pages 324-329. DOI: 10.5220/0005572503240329

@conference{icinco15,
author={Hadhami Kaabi. and Khaled Jabeur.},
title={Hybrid Algorithm for Solving the Multi-compartment Vehicle Routing Problem with Time Windows and Profit},
booktitle={Proceedings of the 12th International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,},
year={2015},
pages={324-329},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005572503240329},
isbn={978-989-758-122-9},
}

TY - CONF

JO - Proceedings of the 12th International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,
TI - Hybrid Algorithm for Solving the Multi-compartment Vehicle Routing Problem with Time Windows and Profit
SN - 978-989-758-122-9
AU - Kaabi, H.
AU - Jabeur, K.
PY - 2015
SP - 324
EP - 329
DO - 10.5220/0005572503240329

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.