paper-with-me

홈 › Papers

Modeling and solving an integrated periodic vehicle routing and capacitated facility location problem in the context of solid waste collection

2025-04-14 · Begoña González, Diego Rossit, Mariano Frutos, Máximo Méndez

Few activities are as crucial in urban environments as waste management. Mismanagement of waste can cause significant economic, social, and environmental damage. However, waste management is often a complex system to manage and therefore where computational decision-support tools can play a pivotal role in assisting managers to make faster and better decisions. In this sense, this article proposes, on the one hand, a unified optimization model to address two common waste management system optimization problem: the determination of the capacity of waste bins in the collection network and the design and scheduling of collection routes. The integration of these two problems is not usual in the literature since each of them separately is already a major computational challenge. On the other hand, two improved exact formulations based on mathematical programming and a genetic algorithm (GA) are provided to solve this proposed unified optimization model. It should be noted that the GA considers a mixed chromosome representation of the solutions combining binary and integer alleles, in order to solve realistic instances of this complex problem. Also, different genetic operators have been tested to study which combination of them obtained better results in execution times on the order of that of the exact solvers. The obtained results show that the proposed GA is able to match the results of exact solvers on small instances and, in addition, can obtain feasible solutions on large instances, where exact formulations are not applicable, in reasonable computation times.

📄 PDF Abstract BibTeX arXiv:2504.10648

Code (1)

diegorossit/anor-s-24-01950 공식 구현

Tasks

ManagementScheduling

Methods 이 논문이 사용한 방법론

GA Genetic Algorithms are search algorithms that mimic Darwinian biological evolution in order to select and propagate better solutions.

Similar Papers 제목 키워드 기반

A Parallel Memetic Algorithm to Solve the Vehicle Routing Problem with Time Windows

2014-02-27 · Jakub Nalepa, Zbigniew J. Czech

This paper presents a parallel memetic algorithm for solving the vehicle routing problem with time windows (VRPTW). The VRPTW is a well-known NP-hard discrete optimization problem with two objectives. The main objective …

A review of approaches to modeling applied vehicle routing problems

2021-05-23 · Konstantin Sidorov, Alexander Morozov

Due to the practical importance of vehicle routing problems (VRP), there exists an ever-growing body of research in algorithms and (meta)heuristics for solving such problems. However, the diversity of VRP domains creates…

Diversityvalid

Integrated routing for a vehicle-robot pickup and delivery system with time constraints

2022-02-09 · Yongjian Li, Yan Chen, Gaicong Guo, Huiwen Wu 외

This paper considers an unmanned vehicle-robot pickup and delivery system, in which a self-driving vehicle carrying multiple unmanned robots in the form of the mother ship travels from a depot to a number of stations dis…

Genetic Algorithms with Neural Cost Predictor for Solving Hierarchical Vehicle Routing Problems

2023-10-22 · Abhay Sobhanan, Junyoung Park, Jinkyoo Park, Changhyun Kwon

When vehicle routing decisions are intertwined with higher-level decisions, the resulting optimization problems pose significant challenges for computation. Examples are the multi-depot vehicle routing problem (MDVRP), w…

Graph Neural Network

Formulating and solving integrated order batching and routing in multi-depot AGV-assisted mixed-shelves warehouses

2021-01-27 · Lin Xie, Hanyi Li, Laurin Luttmann

Different retail and e-commerce companies are facing the challenge of assembling large numbers of time-critical picking orders that include both small-line and multi-line orders. To reduce unproductive picker working tim…