Axle Weights in combined Vehicle Routing and Container Loading Problems
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
Local Search for the Resource Constrained Assignment Problem [PDF]
The resource constrained assignment problem (RCAP) is to find a minimal cost cycle partition in a directed graph such that a resource constraint is fulfilled. The RCAP has its roots in an application that deals with the covering of a railway timetable by
Reuther, Markus
core +1 more source
Performance Evaluation of Emerging Meta‐Heuristic Algorithms on Vehicle Routing Problem
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
MATLAB tool for loading of boxes in 3L-CVRP problem
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
Convex-hull based two-phase algorithm to solve capacitated vehicle routing problem [PDF]
The goal of this paper is to present a two-phase convex hull-based algorithm for the capacitated vehicle routing problem $(CVRP)$, consisting of clustering and routing phases.
M. Afsharirad, A. Hashemi Borzabadi
doaj +1 more source
A tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints [PDF]
This article addresses the well-known Capacitated Vehicle Routing Problem (CVRP), in the special case where the demand of a customer consists of a certain number of two-dimensional weighted items.
Boschetti +28 more
core +1 more source
A Polynomial Time Solvable Capacitated Arc Routing Problem on Regular Grid Graphs
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
A Parallel Hybrid Genetic Search for Solving the Capacitated Vehicle Routing Problem
The Vehicle Routing Problem (VRP) and its variant, the Capacitated VRP (CVRP), are significant optimization challenges in transportation and logistics, impacting fleet management and delivery services.
Mohammad Jamshidi +3 more
doaj +1 more source
Using Recursive KMeans and Dijkstra Algorithm to Solve CVRP
Capacitated vehicle routing problem (CVRP) is being one of the most common optimization problems in our days, considering the wide usage of routing algorithms in multiple fields such as transportation domain, food delivery, network routing, ... Capacitated vehicle routing problem is classified as an NP-Hard problem, hence normal optimization algorithm ...
openaire +2 more sources
A hybrid approach for energy‐efficient routing in IoT using duty cycling and improved ant colony
The proposed approach poses the empirical notion to manage the energy consumption of the IoT network by considering the key performance indicators (KPI) like energy consumption, average residual energy, mobility factor, distance, throughput, and network lifespan to accomplish the tangible outputs.The proposed approach is modelled using DFD's and ...
Bharti Rana +4 more
wiley +1 more source

