The Vehicle Routing Problem (VRP) is a well-known research line in the optimization research community. Its different basic variants have been widely explored in the literature. Even though it has been studied for years, the research around it is still very active. The new tendency is mainly focused on applying this study case to real-life problems. Due to this trend, the Rich VRP arises: combining multiple constraints for tackling realistic problems. Nowadays, some studies have considered specific combinations of real-life constraints to define the emerging Rich VRP scopes. This work surveys the state of the art in the field, summarizing problem combinations, constraints defined, and approaches found.
Current logistics and transportation (L&T) systems include heterogeneous fleets consisting of common internal combustion engine vehicles as well as other types of vehicles using "green" technologies, e.g., plug-in hybrid electric vehicles and electric vehicles (EVs). However, the incorporation of EVs in L&T activities also raise some additional challenges from the strategic, planning, and operational perspectives. For instance, smart cities are required to provide recharge stations for electric-based vehicles, meaning that investment decisions need to be made about the number, location, and capacity of these stations. Similarly, the limited driving-range capabilities of EVs, which are restricted by the amount of electricity stored in their batteries, impose non-trivial additional constraints when designing efficient distribution routes. Accordingly, this paper identifies and reviews several open research challenges related to the introduction of EVs in L&T activities, including: (a) environmental-related issues; and (b) strategic, planning and operational issues associated with "standard" EVs and with hydrogen-based EVs. The paper also analyzes how the introduction of EVs in L&T systems generates new variants of the well-known Vehicle Routing Problem, one of the most studied optimization problems in the L&T field, and proposes the use of metaheuristics and simheuristics as the most efficient way to deal with these complex optimization problems.
This paper reviews the existing literature on the combination of metaheuristics with machine learning methods and then introduces the concept of learnheuristics, a novel type of hybrid algorithms. Learnheuristics can be used to solve combinatorial optimization problems with dynamic inputs (COPDIs). In these COPDIs, the problem inputs (elements either located in the objective function or in the constraints set) are not fixed in advance as usual. On the contrary, they might vary in a predictable (non-random) way as the solution is partially built according to some heuristic-based iterative process. For instance, a consumer's willingness to spend on a specific product might change as the availability of this product decreases and its price rises. Thus, these inputs might take different values depending on the current solution configuration. These variations in the inputs might require from a coordination between the learning mechanism and the metaheuristic algorithm: at each iteration, the learning method updates the inputs model used by the metaheuristic.
This paper proposes a hybrid approach for solving the multidepot vehicle routing problem (MDVRP) with a limited number of identical vehicles per depot. Our approach, which only uses a few parameters, combines "biased randomization"-use of nonsymmetric probability distributions to generate randomness-with the iterated local search (ILS) metaheuristic. Two biased-randomized processes are employed at different stages of the ILS framework in order to (a) assign customers to depots following a randomized priority criterion-this allows for fast generation of alternative allocation maps and (b) improving routing solutions associated with a "promising" allocation map-this is done by randomizing the classical savings heuristic. These biasedrandomized processes rely on the use of the geometric probability distribution, which is characterized by a single and bounded parameter. Being an approach with few parameters, our algorithm does not require troublesome fine-tuning processes, which tend to be time consuming. Using standard benchmarks, the computational experiments show the efficiency of the proposed algorithm. Despite its hybrid nature, our approach is relatively easy to implement and can be parallelized in a very natural way, which makes it an interesting alternative for practical applications of the MDVRP.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.