Some experiments with a savings heuristic and a tabu search approach for the vehicle routing problem with multiple deliverymen

Ferreira, Vanessa de Oliveira; Pureza, Vitória

doi:10.1590/s0101-74382012005000016

Cited by 8 publications

(4 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The following two constraints, ( 32) -( 33), track the DP travel time from the elevator to any node. Constraints (34) state the end of service for a customer j, after the horizontal travel time to the same customer. Constraint (33) points out the exit of the DP to the reception.…”

Section: The Milp Modelmentioning

confidence: 99%

See 1 more Smart Citation

Modeling and Solving the Time-Dependent in-Building Delivery Problem in Last-Mile Logistics

Paredes-Belmar,

Latorre-Núñez,

Bronfman

2024

IEEE Access

View full text Add to dashboard Cite

This article introduces, models, and solves the time-dependent in-building delivery problem in last-mile logistics. It determines efficient travel sequences for a worker (e.g., delivery person, deliveryman, mailman, agent) who delivers goods or provides services directly to customers located within a building using its elevation system. We study, in detail, all the steps involved in a travel sequence inside a building: horizontal trips, unloading products to the customers, waiting for elevators, and vertical trips within elevators. The sequences and their total times vary depending on the building type, the elevation system, the moment of the day, and the arrival time because of the daily building traffic intensity variations. A mixed-integer linear programming model and a genetic algorithm-based metaheuristic are proposed to solve a set of instances in two office buildings. The results show that it is very important to determine the best time to visit a building because of its time dependency. The variation in delivery time between off-peak hours versus peak hours is between 15% and 30% for the set of solved instances. Moreover, the order of customer visits differs drastically depending on the arrival time to the building.INDEX TERMS in-building deliveries, genetic algorithm, last-mile delivery I. INTRODUCTION

show abstract

Section: The Milp Modelmentioning

confidence: 99%

“…Constraint (34) counts the time when the DP leaves the building. Finally, constraints (35)- (38) state the domain of decision variables.…”

Section: The Milp Modelmentioning

confidence: 99%

Modeling and Solving the Time-Dependent in-Building Delivery Problem in Last-Mile Logistics

Paredes-Belmar,

Latorre-Núñez,

Bronfman

2024

IEEE Access

View full text Add to dashboard Cite

show abstract

“…Following same assumption as in Pureza et al (2012), several algorithms have been proposed to solve the VRPTWMD. Ferreira and Pureza (2012) presented a mathematical model and an extended version of the classic savings algorithm (see e.g. Clarke and Wright (1964)) to generate a low cost solution while maximizing the number of served clusters.…”

Section: Introductionmentioning

confidence: 99%

An enhanced iterative three-component heuristic for the team orienteering problem with time windows and multiple deliverymen

2022

Preprint

View full text Add to dashboard Cite

In this paper, we extend the team orienteering problem with time windows by considering multiple deliverymen. This variant arises from piratical situations where firms deliver goods to customers in congested urban areas, and particularly, the service time is a function of the size of crews who are assigned to the vehicles. In addition to the routing and scheduling decisions, the crew size for each route has to be decided. The resulting problem is called the team orienteering problem with time windows and multiple deliverymen (TOPTWMD). We propose an enhanced iterative three-component heuristic to solve this problem. The three components include (i) an iterated local search in feasible region, (ii) a tabu search in infeasible region, and (iii) a route recombination method for a high-quality solution. We conduct computational experiments on a set of test instances, and the results demonstrate the effectiveness of the proposed algorithm in terms of both solution quality and speed. Moreover, we substantiate the contributions of the joint use of the three components and the alteration between feasible and infeasible regions to the performance of the proposed algorithm.

show abstract

“…Recently, it was proposed a new variant of the VRP that treats as a decision variable the number of deliverymen that should be assigned to each delivery route (Pureza et al, 2012;Ferreira & Pureza, 2012). This variant, called as the vehicle routing problem with multiple deliverymen (VRPMD), has applications in real-life transportation, mainly in the distribution of goods in congested urban areas.…”

Section: Introductionmentioning

confidence: 99%

Abordagens metaheurísticas para o problema de roteamento de veículos com janelas de tempo e múltiplos entregadores

Álvarez

Munari

2016

Gest. Prod.

View full text Add to dashboard Cite

Resumo Neste trabalho, aborda-se o problema de roteamento de veículos com janelas de tempo e múltiplos entregadores, uma variante do problema de roteamento de veículos que, além das decisões de programação e roteamento dos veículos, envolve a determinação do tamanho da tripulação de cada veículo de entrega. Esse problema surge na distribuição de bens em centros urbanos congestionados em que, devido aos tempos de serviço relativamente longos, pode ser difícil atender todos os clientes durante o horário de trabalho permitido. Diante dessa dificuldade, uma alternativa consiste em incluir a designação de entregadores adicionais para reduzir os tempos de serviço, o que gera custos adicionais aos custos tradicionais de deslocamento e utilização de veículos. Dessa forma, o objetivo é definir rotas para atender grupos de clientes, minimizando o número de veículos usados, o número de entregadores designados e a distância total percorrida. Para tratar o problema são propostas duas abordagens metaheurísticas baseadas em Busca Local Iterada e Busca em Vizinhança Grande. O desempenho das abordagens propostas é testado utilizando conjuntos de instâncias disponíveis na literatura.

show abstract

Some experiments with a savings heuristic and a tabu search approach for the vehicle routing problem with multiple deliverymen

Cited by 8 publications

References 27 publications

Modeling and Solving the Time-Dependent in-Building Delivery Problem in Last-Mile Logistics

Modeling and Solving the Time-Dependent in-Building Delivery Problem in Last-Mile Logistics

An enhanced iterative three-component heuristic for the team orienteering problem with time windows and multiple deliverymen

Abordagens metaheurísticas para o problema de roteamento de veículos com janelas de tempo e múltiplos entregadores

Contact Info

Product

Resources

About