Results 11 to 20 of about 11,439 (294)

Capacitated vehicle routing problem model for carriers

open access: yesJournal of Transport and Supply Chain Management, 2018
Background: The Capacitated Vehicle Routing Problem (CVRP) is one of the most important transportation problems in logistics and supply chain management.
Irma-Delia Rojas-Cuevas   +3 more
doaj   +3 more sources

The Pyramidal Capacitated Vehicle Routing Problem [PDF]

open access: yesEuropean Journal of Operational Research, 2010
This paper introduces the Pyramidal Capacitated Vehicle Routing Problem (PCVRP) as a restricted version of the Capacitated Vehicle Routing Problem (CVRP).
Lysgaard, Jens
core   +5 more sources

Solving Capacitated Vehicle Routing Problem Using Football Game Algorithm

open access: yesJurnal Ilmiah Teknik Industri, 2022
The Capacitated Vehicle Routing Problem (CVRP) plays an important role in the logistics transportation sector. Determining the proper route will reduce the company's operational costs.
Alfian Alif   +3 more
doaj   +2 more sources

The Two-Echelon Capacitated Vehicle Routing Problem [PDF]

open access: yes, 2007
Multi-echelon distribution systems are quite common in supply-chain and logistic systems. They are used by public administrations in their transportation and traffic planning strategies as well as by companies to model their distribution systems ...
Gonzales Feliu, J.   +3 more
core   +3 more sources

Constrained Fitness Landscape Analysis of Capacitated Vehicle Routing Problems [PDF]

open access: yesEntropy, 2021
Vehicle Routing Problems (VRP) comprise many variants obtained by adding to the original problem constraints representing diverse system characteristics. Different variants are widely studied in the literature; however, the impact that these constraints have on the structure of the search space associated with the problem is unknown, and so is their ...
Sebastián Muñoz-Herrera, Karol Suchan
openaire   +3 more sources

Capacitated Vehicle Routing Problem under Deadlines [PDF]

open access: yes2019 International Conference on Information and Communication Technologies for Disaster Management (ICT-DM), 2019
Fast floods are usually not predictable and lead to lot of damages. In the context of a fast flood, the rescue teams need to elaborate the most efficient plan to save people in the impacted area, “as fast as possible”. Based on discussions with firefighters, the problem is formalized as a Capacitated Vehicle Routing Problem under Deadlines.
Dubois, Florent   +2 more
openaire   +2 more sources

Problem Development, Model Formulation and Proposed Algorithm for CARP with Priority Edges [PDF]

open access: yesInternational Journal of Industrial Engineering and Production Research, 2023
The capacitated arc routing problem (CARP) is an important vehicle routing problem with numerous real world applications. In this paper, an extended version of CARP, the capacitated arc routing problem with priority edges is presented. The new introduced
fahimeh tanhaie, Aylin Pakzad
doaj  

A matheuristic algorithm for the three dimensional loading capacitated vehicle routing problem (3L-CVRP)

open access: yesRevista Facultad de Ingeniería Universidad de Antioquia, 2016
This paper presents a hybrid algorithm for solving the Capacitated Vehicle Routing Problem with practical three-dimensional loading constraint. This problem is known as 3L-CVRP (Three-dimensional Loading Capacitated Vehicle Routing Problem).
Luis Miguel Escobar-Falcón   +4 more
doaj   +1 more source

On the use of biased-randomized algorithms for solving non-smooth optimization problems [PDF]

open access: yes, 2020
Soft constraints are quite common in real-life applications. For example, in freight transportation, the fleet size can be enlarged by outsourcing part of the distribution service and some deliveries to customers can be postponed as well; in inventory ...
Ferrer Biosca, Albert   +4 more
core   +3 more sources

The capacitated vehicle routing problem with reloads [PDF]

open access: yes2006 International Conference on Service Systems and Service Management, 2006
In this paper, we consider a variant of the transportation problem where any demand may be dropped off elsewhere than at its destination, picked up later by the same or another vehicle, and so on until it has reached its destination. We present two mixed integer linear programming formulations based on a space-time graph.
Herve Kerivin   +3 more
openaire   +1 more source

Home - About - Disclaimer - Privacy