In this paper we implement a branch-price and cut algorithm for a time dependent vehicle routing problem with time windows in which the goal is to minimize the total route duration. The travel time between two customers is given by …
The mixed capacitated general routing problem (MCGRP) is defined over a mixed graph, for which some nodes, arcs, and edges must be serviced. The problem consists of determining a set of routes of minimum cost that satisfy the demand. Some …
A time-dependent graph is, informally speaking, a graph structure dynamically changes with time. In such graphs, the weights associated with edges dynamically change over time, that is, the edges in such graphs are activated by sequences of time-dependent elements. Many …
© 2018, Springer Science+Business Media, LLC, part of Springer Nature.In this study, we explore a time-dependent multi-trip vehicle routing problem (TDMTVRP) with an improved travel speed model. This problem is set in a scenario that (a) a set of customers …
© 2000-2011 IEEE.For the benefit of global environmental preservation, electric vehicles (EVs) have been gradually accepted by people in the past few years. However, the technical problem of limited drivable range and long charging duration is still a major hurdle …
© 2019 Association for Computing Machinery.As the remarkable improvement of people’s living levels and interesting for entertainment, the theme park has become one of the most popular places for people to enjoy life. However, since the high popularity of theme …
This paper presents a novel extension of vehicle routing problem considering alternative green-fuel powered vehicles in the presence of congestion, with the aim of minimizing CO2 emissions. The travel time and fuel consumption on each arc are not only dependent …
Integer programs for solving time-dependent models—models in which decisions have to be made about the times at which activities occur and/or resources are utilized—are pervasive in industry, but are notoriously difficult to solve. In the last few years, interest in …
This paper presents an updated and comprehensive review of discrete optimization techniques for solving time-dependent problems, ie decision problems in which activities and resources have to be scheduled over time. Known compact models with continuous variables representing arrival/service/departure times are …