Home // COGNITIVE 2020, The Twelfth International Conference on Advanced Cognitive Technologies and Applications // View article
Authors:
Pedro Pablo Ballesteros Silva
Diana Paola Ballesteros Riveros
Yanci Viviana Castro Bermúdez
Keywords: constructive heuristic; exact techniques; genetic algorithm's Chu-Beasley; matheuristics.
Abstract:
Since many decades ago, one of the topics of greatest interest in research is that one related with the vehicle routing problem, present in many organizations. This, which is a transport problem, has multiple implications of economic, social, technological, and environmental order, when there is a provision of services to customers in the development and implementation of production processes, in the provisioning and distribution of goods and services, including carrying people within a determined time frame, with an adequate quality level. This paper presents a methodology to solve the homogeneous vehicles routing problem with simultaneous pickups and deliveries (VRPSPD) using matheuristics formed by the specialized genetic algorithm's Chu-Beasley and exact techniques of mixed integer linear programming, based on the Branch-and-Bound procedure. The VRPSPD problem considers a set of customers, whose demands of pick-up and delivery of products or people are known, and whose objective is to get the set of routes of minimal cost, which permit to satisfy the demand of the customers, considering the respective constraints of the system and the vehicles necessary for the completion of the same. Two new algorithms designed by the authors are implemented, which have been coded in C ++, obtaining good results in relatively short computing times, depending on the characteristics of the computers used.
Pages: 74 to 83
Copyright: Copyright (c) The Government of Si corresponde, 2020. Used by permission to IARIA.
Publication date: April 26, 2020
Published in: conference
ISSN: 2308-4197
ISBN: 978-1-61208-780-1
Location: Nice, France
Dates: from October 25, 2020 to October 29, 2020