A Survey on Environmentally Friendly Vehicle Routing Problem and a Proposal of Its Classification

The growth of environmental awareness and more robust enforcement of numerous regulations to reduce greenhouse gas (GHG) emissions have directed efforts towards addressing current environmental challenges. Considering the Vehicle Routing Problem (VRP), one of the effective strategies to control greenhouse gas emissions is to convert the fossil fuel-powered fleet into Environmentally Friendly Vehicles (EFVs). Given the multitude of constraints and assumptions defined for different types of VRPs, as well as assumptions and operational constraints specific to each type of EFV, many variants of environmentally friendly VRPs (EF-VRP) have been introduced. In this paper, studies conducted on the subject of EF-VRP are reviewed, considering all the road transport EFV types and problem variants, and classifying and discussing with a single holistic vision. The aim of this paper is twofold. First, it determines a classification of EF-VRP studies based on different types of EFVs, i.e., Alternative-Fuel Vehicles (AFVs), Electric Vehicles (EVs) and Hybrid Vehicles (HVs). Second, it presents a comprehensive survey by considering each variant of the classification, technical constraints and solution methods arising in the literature. The results of this paper show that studies on EF-VRP are relatively novel and there is still room for large improvements in several areas. So, to determine future insights, for each classification of EF-VRP studies, the paper provides the literature gaps and future research needs

Combining heuristics with simulation and fuzzy logic to solve a flexible-size location routing problem under uncertainty

The location routing problem integrates both a facility location and a vehicle routing problem. Each of these problems are NP-hard in nature, which justifies the use of heuristic-based algorithms when dealing with large-scale instances that need to be solved in reasonable computing times. This paper discusses a realistic variant of the problem that considers facilities of different sizes and two types of uncertainty conditions. In particular, we assume that some customers’ demands are stochastic, while others follow a fuzzy pattern. An iterated local search metaheuristic is integrated with simulation and fuzzy logic to solve the aforementioned problem, and a series of computational experiments are run to illustrate the potential of the proposed algorithm.This work has been partially supported by the Spanish Ministry of Science (PID2019-111100RB-C21/AEI/10.13039/501100011033). In addition, it has received the support of the Doctoral School at the Universitat Oberta de Catalunya (Spain) and the Universidad de La Sabana (INGPhD-12-2020).Peer ReviewedPostprint (published version

Heterojen Filolu Yeşil Araç Rotalama Probleminin Tavlama Benzetimi Yöntemi ile Çözümü

Araç rotalama problemi, müşterilere siparişlerini ulaştırmak için minimum maliyetli rota kümesinin belirlendiği optimizasyon problemidir. Son yıllarda çevresel duyarlılıktaki artışla beraber, uygulayıcılar ve araştırmacılar fosil yakıtların çevreye olan etkilerini azaltmak için taşıma faaliyetlerinin çevre ile ilgili özelliklerine odaklanmaya başlamıştır. Araç rotalama probleminin bu duyarlılığı dikkate alan türü ise yeşil araç rotalama problemi olarak adlandırılmaktadır. Yeşil araç rotalama problemi son yıllarda üzerinde oldukça yoğun çalışılan bir konudur. Çalışmanın ana motivasyonu, güncel hayatta doğal olarak karşılaşılan heterojen araç filoları için yük toplama/dağıtma rotalarının işlemesi sonucu ortaya çıkan emisyon gazlarının minimize edilmesi amacıyla bir yaklaşım geliştirmektir. Çalışmada, bölge distribütörü olarak faaliyet gösteren bir firmanın dağıtım faaliyetleri heterojen filolu yeşil araç rotalama problemi olarak ele alınmış ve tavlama benzetimi yöntemiyle daha düşük emisyon değerleri sağlayan çevreci çözümler elde edilmeye çalışılmıştır. Çözüm yaklaşımında heterojen bir filo için emisyon değerleri araçların taşıdığı yük miktarı ve yüklerin taşındığı mesafe üzerinden hesaplanmıştır. Yeşil Araç Rotalama çözümleri, standart araç rotalama problemi olarak elde edilen çözümler üzerinden hesaplanan emisyon değerleri ile kıyaslanmıştır. Sonuç olarak, yük miktarı, taşıma mesafesi ve emisyon salınımı ilişkileri nedeniyle önerilen yaklaşım bazı veri setlerinde daha yüksek dolaşım mesafesine karşın daha düşük emisyon miktarı içeren çözümler sağlamıştır. Bütün çözümlerin toplam değeri göz önüne alındığında, seyahat mesafesi bakımından %38,5 ve emisyon değeri bakımından ise %86,7 oranında daha iyi çözümler elde edilmiştir

Ant-Balanced multiple traveling salesmen: ACO-BmTSP

A new algorithm based on the ant colony optimization (ACO) method for the multiple traveling salesman problem (mTSP) is presented and defined as ACO-BmTSP. This paper addresses the problem of solving the mTSP while considering several salesmen and keeping both the total travel cost at the minimum and the tours balanced. Eleven different problems with several variants were analyzed to validate the method. The 20 variants considered three to twenty salesmen regarding 11 to 783 cities. The results were compared with best-known solutions (BKSs) in the literature. Computational experiments showed that a total of eight final results were better than those of the BKSs, and the others were quite promising, showing that with few adaptations, it will be possible to obtain better results than those of the BKSs. Although the ACO metaheuristic does not guarantee that the best solution will be found, it is essential in problems with non-deterministic polynomial time complexity resolution or when used as an initial bound solution in an integer programming formulation. Computational experiments on a wide range of benchmark problems within an acceptable time limit showed that compared with four existing algorithms, the proposed algorithm presented better results for several problems than the other algorithms did.info:eu-repo/semantics/publishedVersio

Preventing premature convergence and proving the optimality in evolutionary algorithms

http://ea2013.inria.fr//proceedings.pdfInternational audienceEvolutionary Algorithms (EA) usually carry out an efficient exploration of the search-space, but get often trapped in local minima and do not prove the optimality of the solution. Interval-based techniques, on the other hand, yield a numerical proof of optimality of the solution. However, they may fail to converge within a reasonable time due to their inability to quickly compute a good approximation of the global minimum and their exponential complexity. The contribution of this paper is a hybrid algorithm called Charibde in which a particular EA, Differential Evolution, cooperates with a Branch and Bound algorithm endowed with interval propagation techniques. It prevents premature convergence toward local optima and outperforms both deterministic and stochastic existing approaches. We demonstrate its efficiency on a benchmark of highly multimodal problems, for which we provide previously unknown global minima and certification of optimality

A review on delivery routing problem and its approaches

In this paper, a review is conducted specifically in the delivery routing problem, so as to understand its problems and approaches on the current developments and publications. The variants of delivery routing problem were categorized according to the constraints considered in solving the problem. The solution algorithms for the delivery routing problem were classified into hybrid and non-hybrid approaches. A collection of benchmark datasets and real case studies is also presented in relation to the delivery routing problem. The review helps to summarize and record a comprehensive survey on the delivery routing problem. The aims is to organize the variants components of delivery routing problems in a manner that provides a clear view for the readers. New potential research directions resulting from the study is also presented

A Polyhedral Study of Mixed 0-1 Set

We consider a variant of the well-known single node fixed charge network flow set with constant capacities. This set arises from the relaxation of more general mixed integer sets such as lot-sizing problems with multiple suppliers. We provide a complete polyhedral characterization of the convex hull of the given set

A Logistic Mobile Application based on Internet of Things

Abstract-A Logistic Mobile Application is presented. The application is based on Internet of Things and combines a communication infrastructure and a High Performance Computing infrastructure in order to deliver mobile logistic services with high quality of service and adaptation to the dynamic nature of logistic operations