Biased‐randomized iterated local search for a multiperiod vehicle routing problem with price discounts for delivery flexibility

Abstract

The multiperiod vehicle routing problem (MPVRP) is an extension of the vehicle routing problem in which customer demands have to be delivered in one of several consecutive time periods, for example, the days of a week. We introduce and explore a variant of the MPVRP in which the carrier offers a price discount in exchange for delivery flexibility. The carrier's goal is to minimize total costs, which consist of the distribution costs and the discounts paid. A biased-randomized iterated local search algorithm is proposed for its solution. The two-stage algorithm first quickly generates a number of promising customer-to-period assignments, and then intensively explores a subset of these assignments. An extensive computational study demonstrates the efficacy of the proposed algorithm and highlights the benefit of pricing for delivery flexibility in different settings.

A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem

“…The local search embeds a heuristic procedure; the perturbation and the acceptance criterion allow to explore the search space as well as to escape from local optima. The ILS metaheuristic has been applied in many optimization problems, such as vehicle routing problems (Juan et al., ; Pollaris et al., ; Brandão, ; Estrada‐Moreno et al., ), scheduling problems (Zohali et al., ; Cunha et al., ), facility location problems (De Armas et al., ), or inventory routing problems (Alvarez et al., ), among others. In particular, Stützle () and Juan et al.…”

The Non-Smooth and Bi-Objective Team Orienteering Problem with Soft Constraints

“…Biased-randomized techniques induce a non-uniform random behavior in the heuristic by employing skewed probability distributions. These techniques have been widely used to solve different combinatorial optimization problems [34][35][36]. Thus, biased randomization allows for us to transform a deterministic heuristic into a probabilistic algorithm without losing the logic behind the original heuristic.…”

Um Modelo De Otimização Aplicado a Rotas De Vendas De Uma Distribuidora: Um Estudo De Caso

“…Abordando uma extensão do problema de roteamento de veículos conhecida por Problema de Roteamento de Veículos Multiperíodo (MPVRP), Estrada-Moreno et al (2019) propuseram um algoritmo para a solução com base em busca local iterativa e aleatória. O problema consiste em atender demandas de clientes que têm que ser entregues em um dos vários períodos consecutivos, por exemplo, os dias de uma semana.…”