Quality of service objectives for vehicle routing problem with time windows

Expósito, Airam; Brito, Julio; Moreno, José A.; Expósito‐Izquierdo, Christopher

doi:10.1016/j.asoc.2019.105707

Cited by 17 publications

(8 citation statements)

References 44 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In our future works, we will consider more dynamic problems in which not only travelers, but also the traffic conditions are unknown before execution. To this end, we will integrate our vehicle routing system inside the multimodal traffic simulator SM4T [24].…”

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

Dispatching Requests for Agent-Based Online Vehicle Routing Problems with Time Windows

Zargayouna

Zeddini

2020

CIT. J. comput. inf. technol

View full text Add to dashboard Cite

Vehicle routing problems are highly complex problems. The proposals to solve them traditionally concern the optimization of conventional criteria, such as the number of mobilized vehicles and the total costs. However, in online vehicle routing problems, the optimization of the response time to the connected travelers is at least as important as the optimization of the classical criteria. Multi-agent systems on the one hand and greedy insertion heuristics on the other are among the most promising approaches to this end. In this paper, we propose a multi-agent system coupled with a regret insertion heuristic. We focus on the real-time dispatching of the travelers' requests to the vehicles and its efficiency. A dispatching protocol determines which agents perform the computation to answer the travelers' requests. We evaluate three dispatching protocols: centralized, decentralized and hybrid. We compare them experimentally based on their response time to online travelers. Two computational types are implemented: a sequential implementation and a distributed implementation. The results show the superiority of the centralized dispatching protocol in the sequential implementation (32.80% improvement in average compared to the distributed dispatching protocol) and the superiority of the hybrid dispatching protocol in the distributed implementation (59.66% improvement in average, compared with the centralized dispatching protocol).

show abstract

Section: Discussionmentioning

confidence: 99%

“…Solving these problems has high practical usefulness and they are challenging optimization problems with stimulating issues. The problem with time constraints is one of the most widely studied variants of VRP (vehicle routing problem with time windows, VRPTW henceforth [1]). In this variant, the nodes must be visited inside time windows.…”

Section: Introductionmentioning

confidence: 99%

Dispatching Requests for Agent-Based Online Vehicle Routing Problems with Time Windows

Zargayouna

Zeddini

2020

CIT. J. comput. inf. technol

View full text Add to dashboard Cite

show abstract

“…-Minimizing total waiting time -Minimizing average waiting time -Maximizing slack time Greedy randomized adaptive search and Variable neighborhood search [42] Multiple problems:…”

Section: Total Costmentioning

confidence: 99%

Hybrid Heuristic for Vehicle Routing Problem with Time Windows and Compatibility Constraints in Home Healthcare System

Saksuriya

Likasiri

2022

Applied Sciences

View full text Add to dashboard Cite

This work involves a heuristic for solving vehicle routing problems with time windows (VRPTW) with general compatibility-matching between customer/patient and server/caretaker constraints to capture the nature of systems such as caretakers’ home visiting systems or home healthcare (HHC) systems. Since any variation of VRPTW is more complicated than regular VRP, a specific, custom-made heuristic is needed to solve the problem. The heuristic proposed in this work is an efficient hybrid of a novice Local Search (LS), Ruin and Recreate procedure (R&R) and Particle Swarm Optimization (PSO). The proposed LS acts as the initial solution finder as well as the engine for finding a feasible/local optimum. While PSO helps in moving from current best solution to the next best solution, the R&R part allows the solution to be over-optimized and LS moves the solution back on the feasible side. To test our heuristic, we solved 56 benchmark instances of 25, 50, and 100 customers and found that our heuristics can find 52, 21, and 18 optimal cases, respectively. To further investigate the proficiency of our heuristic, we modified the benchmark instances to include compatibility constraints. The results show that our heuristic can reach the optimal solutions in 5 out of 56 instances.

show abstract

“…Actualmente, con la tecnología, el comercio electrónico, los despachos a domicilio, han incrementado la logística de entrega de última milla [1], la cual genera grandes volúmenes de pedidos para las empresas, lo que hace que los programas de generación de ruteo para vehículos sean complejos [2]. El servicio al cliente depende en gran medida del cumplimiento del servicio, la programación y la calidad del producto en la entrega [3]. La estrategia de la cadena de suministro en las empresas se enfoca en reducir los costos logísticos y aumentar la satisfacción del servicio [4].…”

Section: Introductionunclassified

Uso del operador swap genera soluciones eficientes computacionales en un caso de enrutamiento de vehículos con enfoque de ventanas de tiempo

Mejía¹

2021

CESTA

View full text Add to dashboard Cite

Introducción: La programación de ruteo de vehículos con cumplimiento de servicio es una necesidad de las empresas de logística en busca de su ventaja competitiva. Objetivo: El objetivo del siguiente trabajo es determinar la programación al mínimo costo de enrutamiento de vehículos para una flota homogénea, cumpliendo con las ventanas de tiempo. Método: Los costos de logística, incluido el costo de operación de ruta de vehículos, son parte fundamental de la disminución de costos, un aumento directo de las ganancias en las empresas, que va acompañado de la creación de una ventaja competitiva. El modelo matemático utilizado y el desarrollo del algoritmo de optimización combinatoria para un VRPTW se exponen mediante el uso de una matriz de ahorro y heurísticas de swap. Resultados: El algoritmo de ahorro establece la fase de construcción inicial en base a la distancia mínima, y el algoritmo de swap realiza intercambios muy rápidos a través de 12 interacciones para un caso de 300 clientes, buscando mejorar a través de la reducción de tiempos muertos, logrando ahorros del costo total de 71,41% sobre el coste inicial del algoritmo de ahorro. Conclusiones: Para cálculos de casos de CVRPTW de 300 nodos, el algoritmo swap consigue tiempos computacionales menores a 30 segundos.

show abstract

Quality of service objectives for vehicle routing problem with time windows

Cited by 17 publications

References 44 publications

Dispatching Requests for Agent-Based Online Vehicle Routing Problems with Time Windows

Dispatching Requests for Agent-Based Online Vehicle Routing Problems with Time Windows

Hybrid Heuristic for Vehicle Routing Problem with Time Windows and Compatibility Constraints in Home Healthcare System

Uso del operador swap genera soluciones eficientes computacionales en un caso de enrutamiento de vehículos con enfoque de ventanas de tiempo

Contact Info

Product

Resources

About