loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Tayeb Oulad Kouider ; Wahiba Ramdane Cherif-Khettaf and Ammar Oulamara

Affiliation: Université de Lorraine, Lorraine Research Laboratory in Computer Science and its Applications - LORIA (UMR 7503), Campus Scientifique, 615 Rue du Jardin Botanique, 54506 Vandœuvre-les-Nancy and France

Keyword(s): Periodic Vehicle Routing, Electric Vehicle, Charging Station, Large Neighborhood Search.

Related Ontology Subjects/Areas/Topics: Applications ; Operational Research ; OR in Transportation ; Pattern Recognition ; Routing ; Software Engineering

Abstract: In this paper, we address the Periodic Electric Vehicle Routing Problem, named PEVRP. This problem is motivated by a real-life industrial application and it is defined by a planning horizon of several periods typically ”days”, in which each customer has a set of allowed visit days and must be served once in the time horizon. The whole demand of each customer must be fulfilled all together. A limited fleet of electric vehicles is available at the depot. The EVs could be charged during their trips at the depot and in the available external charging stations. The objective of the PEVRP is to minimize the total cost of routing and charging over the time horizon. We propose a Large Neighborhood Search (LNS) framework for solving the PEVRP. Different implementation schemes of the proposed method including customer and station insertion strategies, three destroy operators and three insertion operators are tested on generalized benchmark instances. The computational results show that LNS pro duces competitive results compared to results obtained in previous studies. An analysis of the performance of the proposed operators is also presented. (More)

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 3.15.221.67

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:
Kouider, T.; Cherif-Khettaf, W. and Oulamara, A. (2019). Large Neighborhood Search for Periodic Electric Vehicle Routing Problem. In Proceedings of the 8th International Conference on Operations Research and Enterprise Systems - ICORES; ISBN 978-989-758-352-0; ISSN 2184-4372, SciTePress, pages 169-178. DOI: 10.5220/0007409201690178

@conference{icores19,
author={Tayeb Oulad Kouider. and Wahiba Ramdane Cherif{-}Khettaf. and Ammar Oulamara.},
title={Large Neighborhood Search for Periodic Electric Vehicle Routing Problem},
booktitle={Proceedings of the 8th International Conference on Operations Research and Enterprise Systems - ICORES},
year={2019},
pages={169-178},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0007409201690178},
isbn={978-989-758-352-0},
issn={2184-4372},
}

TY - CONF

JO - Proceedings of the 8th International Conference on Operations Research and Enterprise Systems - ICORES
TI - Large Neighborhood Search for Periodic Electric Vehicle Routing Problem
SN - 978-989-758-352-0
IS - 2184-4372
AU - Kouider, T.
AU - Cherif-Khettaf, W.
AU - Oulamara, A.
PY - 2019
SP - 169
EP - 178
DO - 10.5220/0007409201690178
PB - SciTePress

- Science and Technology Publications, Lda.
RESOURCES

Proceedings

Papers

Authors

Ontology

CONTACTS

Science and Technology Publications, Lda
Avenida de S. Francisco Xavier, Lote 7 Cv. C,
2900-616 Setúbal, Portugal.

Phone: +351 265 520 185 (National fixed network call)
Fax: +351 265 520 186
Email: info@scitepress.org

EXTERNAL LINKS

PRIMORIS

INSTICC

SCITEVENTS

CROSSREF

PROCEEDINGS SUBMITTED FOR INDEXATION BY:

dblp

Ei Compendex

SCOPUS

Semantic Scholar

Google Scholar

Microsoft Academic