Results 201 to 210 of about 107,892 (239)
Some of the next articles are maybe not open access.
AIP Conference Proceedings, 2016
Two new methods adopted from methods commonly used in the field of transportation and logistics are proposed to solve a specific issue of investment allocation problem. Vehicle routing problem and capacitated vehicle routing methods are applied to optimize the fund allocation of a portfolio of investment assets. This is done by determining the sequence
Nur Jumaadzan Zaleha Mamat +2 more
openaire +2 more sources
Two new methods adopted from methods commonly used in the field of transportation and logistics are proposed to solve a specific issue of investment allocation problem. Vehicle routing problem and capacitated vehicle routing methods are applied to optimize the fund allocation of a portfolio of investment assets. This is done by determining the sequence
Nur Jumaadzan Zaleha Mamat +2 more
openaire +2 more sources
Vehicle routing problem with trailers
European Journal of Operational Research, 1996Abstract In this research the vehicle routing problem is extended to the vehicle routing problem with trailers. The optimal deployment of a vehicle fleet of truck-trailer combinations is investigated. Truck-trailer combinations may encounter manoeuvring problems at certain customer sites.
openaire +3 more sources
Multi-objective vehicle routing problems
European Journal of Operational Research, 2008Routing problems, such as the traveling salesman problem and the vehicle routing problem, are widely studied both because of their classic academic appeal and their numerous real-life applications. Similarly, the field of multi-objective optimization is attracting more and more attention, notably because it offers new opportunities for defining ...
Frédéric Semet +3 more
openaire +3 more sources
2017
In this dissertation we consider variants of the vehicle routing problem applied to two problem areas. First, we consider the problem of scheduling deliveries from a central depot to clients in a metric space using a single delivery vehicle. Although this problem involves only a single vehicle rather than a fleet, it is amenable to analysis from both a
openaire +3 more sources
In this dissertation we consider variants of the vehicle routing problem applied to two problem areas. First, we consider the problem of scheduling deliveries from a central depot to clients in a metric space using a single delivery vehicle. Although this problem involves only a single vehicle rather than a fleet, it is amenable to analysis from both a
openaire +3 more sources
2009
Vehicle routing problem (VRP) is concerned with finding efficient routes, beginning and ending at a central depot, for a fleet of vehicles to serve a number of customers.
openaire +2 more sources
Vehicle routing problem (VRP) is concerned with finding efficient routes, beginning and ending at a central depot, for a fleet of vehicles to serve a number of customers.
openaire +2 more sources
Timing problems and vehicle routing
2011International ...
Vidal, Thibaut +3 more
openaire +4 more sources
The Hybrid Vehicle Routing Problem
Transportation Research Part C: Emerging Technologies, 2017Abstract In this paper the Hybrid Vehicle Routing Problem (HVRP) is introduced and formalized. This problem is an extension of the classical VRP in which vehicles can work both electrically and with traditional fuel. The vehicle may change propulsion mode at any point of time.
openaire +3 more sources
The Green-Vehicle Routing Problem: A Survey
2020In recent years, we have witnessed a dramatic rise of pollution levels in many areas of the world. Even if several green initiatives have been made in order to preserve and restore the environment, several nations do not respect their air quality standards.
Macrina, Giusy +2 more
openaire +5 more sources
Route relaxations on GPU for vehicle routing problems
European Journal of Operational Research, 2017State-Space Relaxation (SSR) is an approach often used to compute by dynamic programming (DP) effective bounds for many combinatorial optimization problems. Currently, the most effective exact approaches for solving many Vehicle Routing Problems (VRPs) are DP algorithms making use of SSR for computing their bounding components.
BOSCHETTI, MARCO ANTONIO +2 more
openaire +2 more sources
A Green Vehicle Routing Problem
Transportation Research Part E: Logistics and Transportation Review, 2012Abstract A Green Vehicle Routing Problem (G-VRP) is formulated and solution techniques are developed to aid organizations with alternative fuel-powered vehicle fleets in overcoming difficulties that exist as a result of limited vehicle driving range in conjunction with limited refueling infrastructure.
Elise Miller-Hooks, Sevgi Erdogan
openaire +2 more sources