Article
Mathematics
Yusuf Yilmaz, Can B. Kalayci
Summary: This paper addresses the Electric Vehicle Routing Problem with Simultaneous Pickup and Delivery, proposing an efficient solution using an integer linear model and variable neighborhood search algorithm to minimize total distance traveled. Experimental results show that the proposed method achieves efficient solutions in terms of solution quality and time.
Article
Computer Science, Artificial Intelligence
Ran Liu, Shan Jiang
Summary: This paper discusses the two-echelon vehicle routing problem with simultaneous delivery and pickup demands (2E-VRPSDP), which differs from classic transportation and vehicle routing problems. A variable neighborhood search algorithm is proposed to solve the problem, and numerical results show that the algorithm can provide reasonable solutions within an acceptable computational time.
Article
Chemistry, Multidisciplinary
Dan Wang, Hong Zhou
Summary: This study proposes a new vehicle routing problem model that effectively reduces transportation costs for enterprises, and its efficiency is validated through extensive numerical experiments.
APPLIED SCIENCES-BASEL
(2021)
Article
Computer Science, Interdisciplinary Applications
Timo Hintsch
Summary: The paper introduces a large multiple neighborhood search algorithm for the SoftCluVRP, utilizing various cluster destroy and repair operators and two post optimization components. Computational experiments demonstrate that the algorithm outperforms existing heuristic approaches and provides 130 new best solutions for medium-sized instances.
COMPUTERS & OPERATIONS RESEARCH
(2021)
Article
Economics
Sercan Donmez, Cagri Koc, Fulya Altiparmak
Summary: In this study, we introduce the Mixed Fleet Vehicle Routing Problem with Time Windows and Partial Recharging by Multiple Chargers (MF-VRP-MC), and propose a mixed integer mathematical programming model and an Adaptive Large Neighborhood Search (ALNS) algorithm. The computational results demonstrate that our ALNS algorithm performs well on large-scale instances.
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW
(2022)
Article
Economics
Mir Ehsan Hesam Sadati, Bulent Catay
Summary: The Multi-Depot Green Vehicle Routing Problem extends the well-known GVRP and proposes new neighborhood structures to effectively solve the problem. Evaluation using literature dataset shows high performance of the method in providing high quality solutions in short computation times.
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW
(2021)
Article
Computer Science, Interdisciplinary Applications
Mir Ehsan Hesam Sadati, Bulent Catay, Deniz Aksen
Summary: The VTNS algorithm is a flexible algorithm for solving Multi-Depot Vehicle Routing Problems, capable of adapting to different types of problems and providing competitive results in terms of solution quality and run time.
COMPUTERS & OPERATIONS RESEARCH
(2021)
Article
Computer Science, Artificial Intelligence
Vincent F. Yu, Panca Jodiawan, Aldy Gunawan
Summary: This study addresses the Green Mixed Fleet Vehicle Routing Problem with Realistic Energy Consumption and Partial Recharges by developing an adaptive Large Neighborhood Search heuristic. Experimental results show that the proposed algorithm finds optimal solutions for most small-scale instances in a significantly faster computational time compared to CPLEX solver and obtains high quality solutions for medium- and large-scale instances. Numeric studies are also conducted to analyze the potential carbon emission reduction from the proposed model.
APPLIED SOFT COMPUTING
(2021)
Article
Computer Science, Interdisciplinary Applications
Sinaide Nunes Bezerra, Marcone Jamilson Freitas, Sergio Ricardo de Souza
Summary: This article addresses the MDVRPTW* problem and proposes an algorithm called SGVNSALS to solve it. The algorithm outperforms other algorithms in terms of the number of used vehicles and covered distance.
COMPUTERS & OPERATIONS RESEARCH
(2023)
Review
Management
Natasja Sluijk, Alexandre M. Florio, Joris Kinable, Nico Dellaert, Tom Van Woensel
Summary: The two-echelon vehicle routing problem (2E-VRP) involves splitting the distribution network into two levels. This review examines the literature on 2E-VRP, including mathematical formulations, solution methods, and benchmark datasets, emphasizing the academic and practical significance of 2E-VRP.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2023)
Article
Computer Science, Software Engineering
Erdener Ozcetin, Gurkan Ozturk
Summary: This study discusses the Open Vehicle Routing Problem commonly used by companies with third-party logistics services, which belongs to the class of high-dimensional and complex optimization problems. A three-phase Variable Neighborhood Search Algorithm is proposed to efficiently solve large-scale problems. The algorithm utilizes eight different neighborhoods and employs wise shaking strategies to overcome local optimal solutions. The method's competitiveness is tested on literature test instances and comparatively evaluated.
CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE
(2023)
Article
Computer Science, Artificial Intelligence
Panagiotis Kalatzantonakis, Angelo Sifaleras, Nikolaos Samaras
Summary: This paper proposes a new hyperheuristic scheme, called Bandit VNS, that utilizes reinforcement learning methods to improve the performance of Variable Neighborhood Search. By modifying the Upper Confidence Bound algorithm and utilizing Adaptive Windowing, Bandit VNS achieves better solution quality and speed in solving complex problems.
EXPERT SYSTEMS WITH APPLICATIONS
(2023)
Article
Mathematics
Lamiaa Dahite, Abdeslam Kadrani, Rachid Benmansour, Rym Nesrine Guibadj, Cyril Fonlupt
Summary: This paper addresses the problem faced by maintenance service providers in performing maintenance activities on geographically distributed machines. It proposes a new bi-objective mathematical model and algorithms to determine the optimal maintenance and routing plan simultaneously. The efficiency of the approach is demonstrated through experiments.
Article
Management
Christopher Bayliss, Tolga Bekta, Vernon Tjon-Soei-Len, Remo Rohner
Summary: This paper proposes a last-mile logistics delivery system that utilizes multiple localised storage depots and multi-modal delivery options. The system aims to improve express and instant delivery services through localised storage depots and overcome vehicle access restrictions through multi-modal delivery. The paper presents a mathematical formulation and a heuristic algorithm to solve the multi-modal delivery problem.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2023)
Article
Economics
Dorian Dumez, Fabien Lehuede, Olivier Peton
Summary: This article proposes a solution for last mile delivery with multiple delivery options, successfully addressing specific cases of vehicle routing problems through large neighborhood search and specific operators.
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL
(2021)
Article
Operations Research & Management Science
Olcay Polat, Duygu Topaloglu
Summary: The study introduces a novel mathematical model to address uncertainty in milk collection, providing important recommendations for designing efficient collection networks.
Article
Automation & Control Systems
Jon Perez, Jose Luis Flores, Christian Blum, Jesus Cerquides, Alex Abuin
Summary: This article describes a method based on optimization and formal verification for designing safety-critical systems. Multiple optimization techniques and a hybrid approach are used to find a design that meets performance, availability, and safety requirements, and then translate it into a formally verifiable knowledge representation.
IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS
(2022)
Article
Computer Science, Artificial Intelligence
Marko Djukanovic, Aleksandar Kartelj, Dragan Matic, Milana Grbic, Christian Blum, Guenther R. Raidl
Summary: This paper addresses the constrained longest common subsequence problem with arbitrary input and pattern strings. The problem has applications in computational biology, and the authors contribute by proving its NP-completeness and proposing heuristic approaches. An extensive experimental study is conducted to compare the effectiveness of the proposed approaches on artificial and real-world instances.
APPLIED SOFT COMPUTING
(2022)
Article
Chemistry, Analytical
Salim Bouamama, Christian Blum, Pedro Pinacho-Davidson
Summary: Finding dominating sets in wireless sensor networks is important for extending network lifetime. This paper proposes a population-based iterated greedy algorithm to solve the weighted maximum disjoint dominating sets problem. The algorithm outperforms existing techniques in terms of energy conservation.
Article
Computer Science, Artificial Intelligence
Mehmet Anil Akbay, Albert Lopez Serrano, Christian Blum
Summary: The CMSA is a generic algorithm for combinatorial optimization, but it can be sensitive to parameter settings in some applications. This study proposes a self-adaptive variant, Adapt-CMSA, to reduce the parameter sensitivity of CMSA. The advantages of this new variant are demonstrated in the context of the minimum positive influence dominating set problem.
INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS
(2022)
Article
Computer Science, Artificial Intelligence
Marko Djukanovic, Aleksandar Kartelj, Christian Blum
Summary: This paper presents an algorithm for the multidimensional multi-way number partitioning problem, which aims to divide a set of vectors into non-empty subsets with similar coordinate sums. The algorithm outperforms four competing algorithms from the literature, especially for instances with higher k-values. Experimental evaluation shows that the proposed algorithm achieves average relative differences larger than 25% compared to the second-best approach, and significantly outperforms other approaches for all instances with k & GE; 3.
EXPERT SYSTEMS WITH APPLICATIONS
(2023)
Article
Computer Science, Software Engineering
Camilo Chacon Sartori, Christian Blum, Gabriela Ochoa
Summary: STNWeb is a new web tool that visualizes the behavior of optimization algorithms, helping users analyze and understand algorithm performance. It allows for multiple runs of multiple algorithms on the same problem instance, facilitating the identification of algorithm weaknesses and informing improvements. STNWeb is designed to be user-friendly and is offered free of charge to the research community.
Proceedings Paper
Computer Science, Artificial Intelligence
Jairo Enrique Ramirez Sanchez, Camilo Chacon Sartori, Christian Blum
Summary: This paper explores the use of deep learning framework to enhance an ant colony optimization algorithm. By combining problem information obtained via deep learning with the conventional pheromone and greedy information, our algorithm achieves better performance. Experimental results demonstrate that the hybrid algorithm outperforms the pure ant colony optimization approach, especially for large problem instances.
PROCEEDINGS OF THE 2023 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, GECCO 2023
(2023)
Proceedings Paper
Computer Science, Software Engineering
Mehmet Anil Akbay, Can Berk Kalayci, Christian Blum
Summary: This study addresses the two-echelon electric vehicle routing problem with simultaneous pickup and deliveries. The problem is solved using a MILP model and a hybrid metaheuristic algorithm. The algorithm outperforms CPLEX in smaller problem instances and also performs better than heuristic algorithms in larger instances.
EVOLUTIONARY COMPUTATION IN COMBINATORIAL OPTIMIZATION, EVOCOP 2023
(2023)
Proceedings Paper
Computer Science, Software Engineering
Christian Blum, Pedro Pinacho-Davidson
Summary: The paper proposes the use of ant colony optimization-negative learning ant colony optimization to solve the far from most string problem, a challenging combinatorial optimization problem. The algorithm incorporates negative learning in addition to positive learning to improve the exploration of the search space. Different versions of the algorithm with different objective functions are compared, revealing that no existing method is universally best for all problem instances.
EVOLUTIONARY COMPUTATION IN COMBINATORIAL OPTIMIZATION, EVOCOP 2023
(2023)
Article
Computer Science, Software Engineering
Guillem Rodriguez Corominas, Maria J. Blesa, Christian Blum
Summary: In this paper, the authors introduce AntNetAlign, an open-source tool that uses Ant Colony Optimization to solve the Network Alignment problem. The tool finds an alignment between two input networks that optimizes one of the three main topological measures. It can also utilize user-defined pairwise similarities to enhance its performance. Results show that AntNetAlign outperforms other state-of-the-art algorithms in two of the three topological scores and achieves competitive results in larger instances.