Soft computing for hazardous waste routing in Malaysia: a review

Nowadays, a significant number of researchers are focusing on utilizing soft computing approaches to address the issue of scheduling in applications concerned with hazardous waste management. In Malaysia, there is thoughtless awareness of the management of hazardous waste, even though the production of wastes in hazardous domains at the industrial and domestic levels has been rising lately. According to previous research findings, the location routing problem (LRP) can be designated as one of the models closer to the actual situation, evaluating the most suitable and optimal location for establishing facilities and utilizing transportation for pick-up and distribution. Recent studies have focused on enhancing the LRP model, and its methodologies approach to solve the waste management problem in hazardous domains. In this paper, a comprehensive review of the better promising and practicable mathematical model of LRP and its methodology approach is discussed, as well as an analysis of the publishing pattern and the trend of research over the preceding five years and more, as retrieved from the web of science (WoS) database. In conclusion, this research is significant in ensuring the effectiveness of reliable mathematical model development and suitable methodologies in the future for solving hazardous waste management problems

Risk based, multi objective vehicle routing problem for hazardous materials: a test case in downstream fuel logistics

Abstract The paper analyses a practical case of study related to the distribution of fuels for the Total Erg Oil Company to the service stations located in the Province of Rome (Italy). The problem is formulated as a capacitated vehicle routing problem with time windows, where several heuristic procedures have been tested, considering both static and dynamic travel times. With respect to the standard operational costs used typically, a multivariable objective function has been proposed which takes into account also a new risk index. The risk index proposed is function of the population density of the zones covered by each path and of the estimated number of road accidents on each road link. In such a way, we take into account the population's exposure to the risk associated with an incidental event involving a fuel tank. The obtained output is the set of planned routes with minimum service cost and minimum risk. Results demonstrate how an accurate planning of the service saves up to 3 hours and 30 km on a daily basis compared to a benchmark. Moreover, the distribution company can parameterize the configuration of the service, by varying the weight adopted in order to include the risk index. Including the risk index may bring to a higher safety route planning, with an increase of the operating costs of only 2%

Solid Waste Collection Optimization: A literature Review

The urban population saw an increase of 80 million in 2019. The accelerated movement of people towards urban centres along with annual increasing per capita waste generation calls for an urgent need to address the rising solid waste generation. Contemporary pandemic of Covid-19 puts the demand all time high for revival and optimizing solid waste management system. For optimizing solid waste management, solid waste collection is the most important aspect of process as it includes majority of financial inputs. This article aims to provide literature review regarding different methodologies and criteria for solid waste collection optimization. The article also examines trends and areas of future research along with unexplored and budding domains. This would help reader identifying his interest area besides getting a comprehensive understanding of research trends. The study could also be used by waste management firms to analyze, compare different methods, their performance and their suitability under different environment conditions.

On green routing and scheduling problem

The vehicle routing and scheduling problem has been studied with much interest within the last four decades. In this paper, some of the existing literature dealing with routing and scheduling problems with environmental issues is reviewed, and a description is provided of the problems that have been investigated and how they are treated using combinatorial optimization tools

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

The Bi-objective Periodic Closed Loop Network Design Problem

© 2019 Elsevier Ltd. This manuscript is made available under the terms of the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International licence (CC BY-NC-ND 4.0). For further details please see: https://creativecommons.org/licenses/by-nc-nd/4.0/Reverse supply chains are becoming a crucial part of retail supply chains given the recent reforms in the consumers’ rights and the regulations by governments. This has motivated companies around the world to adopt zero-landfill goals and move towards circular economy to retain the product’s value during its whole life cycle. However, designing an efficient closed loop supply chain is a challenging undertaking as it presents a set of unique challenges, mainly owing to the need to handle pickups and deliveries at the same time and the necessity to meet the customer requirements within a certain time limit. In this paper, we model this problem as a bi-objective periodic location routing problem with simultaneous pickup and delivery as well as time windows and examine the performance of two procedures, namely NSGA-II and NRGA, to solve it. The goal is to find the best locations for a set of depots, allocation of customers to these depots, allocation of customers to service days and the optimal routes to be taken by a set of homogeneous vehicles to minimise the total cost and to minimise the overall violation from the customers’ defined time limits. Our results show that while there is not a significant difference between the two algorithms in terms of diversity and number of solutions generated, NSGA-II outperforms NRGA when it comes to spacing and runtime.Peer reviewedFinal Accepted Versio

A study on exponential-size neighborhoods for the bin packing problem with conflicts

We propose an iterated local search based on several classes of local and large neighborhoods for the bin packing problem with conflicts. This problem, which combines the characteristics of both bin packing and vertex coloring, arises in various application contexts such as logistics and transportation, timetabling, and resource allocation for cloud computing. We introduce $O(1)$ evaluation procedures for classical local-search moves, polynomial variants of ejection chains and assignment neighborhoods, an adaptive set covering-based neighborhood, and finally a controlled use of 0-cost moves to further diversify the search. The overall method produces solutions of good quality on the classical benchmark instances and scales very well with an increase of problem size. Extensive computational experiments are conducted to measure the respective contribution of each proposed neighborhood. In particular, the 0-cost moves and the large neighborhood based on set covering contribute very significantly to the search. Several research perspectives are open in relation to possible hybridizations with other state-of-the-art mathematical programming heuristics for this problem.Comment: 26 pages, 8 figure