Results 41 to 50 of about 413 (166)

Memetic Search With Interdomain Learning: A Realization Between CVRP and CARP [PDF]

open access: yesIEEE Transactions on Evolutionary Computation, 2015
In recent decades, a plethora of dedicated evolutionary algorithms (EAs) have been crafted to solve domain-specific complex problems more efficiently. Many advanced EAs have relied on the incorporation of domain-specific knowledge as inductive biases that is deemed to fit the problem of interest well.
Feng, Liang   +3 more
openaire   +2 more sources

Fast Shapley Value Approximation Through Machine Learning With Application in Routing Problems

open access: yesNetworks, Volume 86, Issue 4, Page 402-427, December 2025.
ABSTRACT For many routing applications, it is not only necessary to minimize total costs but also to allocate them to individual customers. In this context, the allocation according to the Shapley value is a well‐known method highly regarded for its fulfillment of major fairness criteria.
Johannes Gückel, Pirmin Fontaine
wiley   +1 more source

MENYELESAIKAN VEHICLE ROUTING PROBLEM MENGGUNAKAN ALGORITMA FUZZY EVOLUSI

open access: yesE-Jurnal Matematika, 2018
The purpose of this research is to know the performance of Fuzzy Evolutionary Algorithm in solving one type of Vehicle Routing Problem that is Capacitated Vehicle Routing Problem (CVRP). There are 8 different CVRP data to be solved.
I PUTU ARYA YOGA SUMADI   +2 more
doaj   +1 more source

On Combining Conventional Point‐To‐Point and Automated Waste Collection Systems

open access: yesNetworks, Volume 86, Issue 2, Page 174-198, September 2025.
ABSTRACT The global demand for sustainable waste management has spurred initiatives to improve the efficiency of urban waste collection, discussing the advantages and disadvantages of different systems. We analyze a new combined waste collection problem that uses two systems simultaneously: a point‐to‐point system, in which waste is collected using ...
Maryam DehghanChenary   +3 more
wiley   +1 more source

Performance Evaluation of Emerging Meta‐Heuristic Algorithms on Vehicle Routing Problem

open access: yesEngineering Reports, Volume 7, Issue 7, July 2025.
This research offers a comprehensive approach to the sustainable design of supply chains, providing insights into cost‐effective, low‐emission fuel production pathways for the aviation sector. ABSTRACT This research provides a comprehensive evaluation of seven emergent meta‐heuristic algorithms, including flying fox optimization (FFO), Giza pyramids ...
Hadi Barati   +7 more
wiley   +1 more source

A deep reinforcement learning and fractional packing framework for routing and scheduling in healthcare waste supply chains

open access: yesSupply Chain Analytics
Artificial intelligence (AI) is increasingly utilized in healthcare logistics, including automated systems for collecting hazardous medical waste from hospitals under strict time and capacity constraints. This study compares three routing algorithms: (1)
Norhan Khallaf   +4 more
doaj   +1 more source

Axle Weights in combined Vehicle Routing and Container Loading Problems

open access: yesEURO Journal on Transportation and Logistics, 2021
Overloaded axles not only lead to increased erosion on the road surface, but also to an increased braking distance and more serious accidents due to higher impact energy. Therefore, the load on axles should be already considered during the planning phase
Corinna Krebs, Jan Fabian Ehmke
doaj   +1 more source

A Polynomial Time Solvable Capacitated Arc Routing Problem on Regular Grid Graphs

open access: yesNetworks, Volume 85, Issue 3, Page 272-287, April 2025.
ABSTRACT The general Capacitated Arc Routing Problem (CARP) is a well‐known optimization problem where a set of edges must be visited by a fleet of vehicles. It is known to be NP‐hard, meaning that it cannot in general be solved efficiently (unless 𝒫=𝒩𝒫). This article introduces a polynomial‐time solvable special case of the CARP on regular grid graphs
Qian Wan   +4 more
wiley   +1 more source

Solving the capacitated vehicle routing problem with stochastic demands applying the simulated annealing algorithm

open access: yesProgramación Matemática y Software, 2014
A new hybrid algorithm for solving the capacitated vehicle routing problem (CVRP) with stochastic demands is proposed. This new approach combines the simulated annealing (SA) with the savings algorithms and is implemented to obtain results of several ...
Ernesto Liñán García   +2 more
doaj  

MATLAB tool for loading of boxes in 3L-CVRP problem

open access: yesProgramación Matemática y Software, 2020
The Three-Dimensional Capacitated Vehicle Routing Problem, or 3L-CVRP, is one NP-Hard Problem in the logistics field. In the 3L-CVRP the length, width and height dimensions of items and vehicle are considered.
Irma-Delia Rojas-Cuevas   +4 more
doaj  

Home - About - Disclaimer - Privacy