Results 181 to 190 of about 4,867 (222)
Some of the next articles are maybe not open access.

Efficient PTAS for the Euclidean CVRP with Time Windows

2018
The Capacitated Vehicle Routing Problem (CVRP) is the well-known combinatorial optimization problem having a wide range of practical applications in operations research. It is known that the problem is NP-hard and remains intractable even in the Euclidean plane.
Michael Khachay, Yuri Ogorodnikov
openaire   +1 more source

Solving the CVRP Problem Using a Hybrid PSO Approach

2013
The goal of the capacitated vehicle routing problem (CVRP) is to minimize the total distance of vehicle routes under the constraints of vehicles’ capacity. CVRP is classified as NP-hard problems and a number of meta-heuristic approaches have been proposed to solve the problem.
Yucheng Kao, Mei Chen
openaire   +1 more source

CVRP 2021 Data Brief: Consumer Characteristics

2023
Williams, Brett David Hishigata   +1 more
openaire   +1 more source

CVRP 2020 Data Brief: MSRP Considerations

2022
Williams, Brett David Hishigata   +1 more
openaire   +1 more source

CVRP 2020 Data Brief: Incentive Influence

2022
Williams, Brett David Hishigata   +1 more
openaire   +1 more source

CVRP 2020 Data Brief: Vehicle Replacement

2022
Williams, Brett David Hishigata   +1 more
openaire   +1 more source

Video: “CVRP 2020 Data Brief: Consumer Characteristics”

2022
Williams, Brett David Hishigata   +1 more
openaire   +1 more source

CVRP Implementation Status Update

2015
Santulli, Colin M.   +1 more
openaire   +1 more source

Memetic Grey Wolf Optimizer Algorithm for Solving the Cumulative CVRP

International Journal of Autonomous and Adaptive Communications Systems, 2023
Yanguang Cai   +4 more
openaire   +1 more source

Home - About - Disclaimer - Privacy