Hybrid metaheuristics for solving multi-depot pickup and delivery problems

In today's logistics businesses, increasing petrol prices, fierce competition, dynamic business environments and volume volatility put pressure on logistics service providers (LSPs) or third party logistics providers (3PLs) to be efficient, differentiated, adaptive, and horizontally collaborative in order to survive and remain competitive. In this climate, efficient computerised-decision support tools play an essential role. Especially, for freight transportation, e efficiently solving a Pickup and Delivery Problem (PDP) and its variants by an optimisation engine is the core capability required in making operational planning and decisions. For PDPs, it is required to determine minimum-cost routes to serve a number of requests, each associated with paired pickup and delivery points. A robust solution method for solving PDPs is crucial to the success of implementing decision support tools, which are integrated with Geographic Information System (GIS) and Fleet Telematics so that the flexibility, agility, visibility and transparency are fulfilled. If these tools are effectively implemented, competitive advantage can be gained in the area of cost leadership and service differentiation. In this research, variants of PDPs, which multiple depots or providers are considered, are investigated. These are so called Multi-depot Pickup and Delivery Problems (MDPDPs). To increase geographical coverage, continue growth and encourage horizontal collaboration, efficiently solving the MDPDPs is vital to operational planning and its total costs. This research deals with designing optimisation algorithms for solving a variety of real-world applications. Mixed Integer Linear Programming (MILP) formulations of the MDPDPs are presented. Due to being NP-hard, the computational time for solving by exact methods becomes prohibitive. Several metaheuristics and hybrid metaheuristics are investigated in this thesis. The extensive computational experiments are carried out to demonstrate their speed, preciseness and robustness.Open Acces

HEDCOS: High Efficiency Dynamic Combinatorial Optimization System using Ant Colony Optimization algorithm

This thesis was submitted for the award of Doctor of Philosophy and was awarded by Brunel University LondonDynamic combinatorial optimization is gaining popularity among industrial practitioners due to the ever-increasing scale of their optimization problems and efforts to solve them to remain competitive. Larger optimization problems are not only more computationally intense to optimize but also have more uncertainty within problem inputs. If some aspects of the problem are subject to dynamic change, it becomes a Dynamic Optimization Problem (DOP). In this thesis, a High Efficiency Dynamic Combinatorial Optimization System is built to solve challenging DOPs with high-quality solutions. The system is created using Ant Colony Optimization (ACO) baseline algorithm with three novel developments. First, introduced an extension method for ACO algorithm called Dynamic Impact. Dynamic Impact is designed to improve convergence and solution quality by solving challenging optimization problems with a non-linear relationship between resource consumption and fitness. This proposed method is tested against the real-world Microchip Manufacturing Plant Production Floor Optimization (MMPPFO) problem and the theoretical benchmark Multidimensional Knapsack Problem (MKP). Second, a non-stochastic dataset generation method was introduced to solve the dynamic optimization research replicability problem. This method uses a static benchmark dataset as a starting point and source of entropy to generate a sequence of dynamic states. Then using this method, 1405 Dynamic Multidimensional Knapsack Problem (DMKP) benchmark datasets were generated and published using famous static MKP benchmark instances as the initial state. Third, introduced a nature-inspired discrete dynamic optimization strategy for ACO by modelling real-world ants’ symbiotic relationship with aphids. ACO with Aphids strategy is designed to solve discrete domain DOPs with event-triggered discrete dynamism. The strategy improved inter-state convergence by allowing better solution recovery after dynamic environment changes. Aphids mediate the information from previous dynamic optimization states to maximize initial results performance and minimize the impact on convergence speed. This strategy is tested for DMKP and against identical ACO implementations using Full-Restart and Pheromone-Sharing strategies, with all other variables isolated. Overall, Dynamic Impact and ACO with Aphids developments are compounding. Using Dynamic Impact on single objective optimization of MMPPFO, the fitness value was improved by 33.2% over the ACO algorithm without Dynamic Impact. MKP benchmark instances of low complexity have been solved to a 100% success rate even when a high degree of solution sparseness is observed, and large complexity instances have shown the average gap improved by 4.26 times. ACO with Aphids has also demonstrated superior performance over the Pheromone-Sharing strategy in every test on average gap reduced by 29.2% for a total compounded dynamic optimization performance improvement of 6.02 times. Also, ACO with Aphids has outperformed the Full-Restart strategy for large datasets groups, and the overall average gap is reduced by 52.5% for a total compounded dynamic optimization performance improvement of 8.99 times

Optimization strategies for the integrated management of perishable supply chains: A literature review

Purpose: The main purpose of this article is to systematically review the papers published in the period 2005-2020 about the integration of production, inventory and distribution activities in perishable supply chains. Design/methodology/approach: The proposed research methodology is based on several steps. First, database and keywords are selected, with the aim to search and collect the main papers, dealing with the integration of production, inventory, distribution activities in perishable supply chains. Then, a bibliometric analysis is carried out, to detect: the main publishing sources, the chronological distribution, the most used keywords, the featured authors, about the selected papers. A five-dimension classification framework is proposed to carry out a content analysis, where the papers of the literature review are classified and discussed, according to: supply chain structure, objective, perishability type, solution approach, approach validation. Findings: Interest in the application of optimization models for integrated decision-making along perishable supply chains is strongly growing. Integrating multiple stages of the supply chain into a single framework is complex, especially when referring to perishable products. The vast majority of the problems addressed are then NP-Hard. Only a limited quantity of the selected papers aims to solve real-life case studies. There is a need for further research, which is capable of modeling and quantitatively improving existing supply chains. The potentials of Industry 4.0 are currently little explored. Originality/value: Based on the analysis of the papers published, this article outlines the current state of the art on the optimization strategies for the integrated management of perishable supply chains, which are very complex to be managed. Research trends and gaps are discussed, future challenges are presentedPeer Reviewe

Dynamic Impact for Ant Colony Optimization algorithm

This paper proposes an extension method for Ant Colony Optimization (ACO) algorithm called Dynamic Impact. Dynamic Impact is designed to solve challenging optimization problems that has nonlinear relationship between resource consumption and fitness in relation to other part of the optimized solution. This proposed method is tested against complex real-world Microchip Manufacturing Plant Production Floor Optimization (MMPPFO) problem, as well as theoretical benchmark Multi-Dimensional Knapsack problem (MKP). MMPPFO is a non-trivial optimization problem, due the nature of solution fitness value dependence on collection of wafer-lots without prioritization of any individual wafer-lot. Using Dynamic Impact on single objective optimization fitness value is improved by 33.2%. Furthermore, MKP benchmark instances of small complexity have been solved to 100% success rate where high degree of solution sparseness is observed, and large instances have showed average gap improved by 4.26 times. Algorithm implementation demonstrated superior performance across small and large datasets and sparse optimization problems.Intel Corporatio

Sustainable Supply Chain Management

The book is a collection of studies dedicated to different perspectives of three dimensions or pillars of the sustainability of supply chain and supply chain management - economic, environmental, and social - and other aspects related to performance evaluation, optimization, and modelling of and for sustainable supply chain management, and thus presents another valuable contribution to sustainable development and sustainable way of life

Diseño de estrategias logísticas para impulsar la competitividad del sector de distribución en Colombia al año 2050 a partir de herramientas prospectivas

91 páginasEl nivel económico y social de un país depende en gran parte de su competitividad, concepto que comprende las condiciones que otorgan ventajas comerciales a los países, regiones, industrias o empresas. La competitividad se ve afectada por la capacidad de disponer medios de soporte a la economía, tales como infraestructura, telecomunicaciones y políticas públicas, que brinden un escenario favorable para ser eficientes, manteniendo bajos los costos de disponer bienes y servicios tanto al interior como al exterior de un país. Esta investigación propone realizar un estudio prospectivo sobre el sistema logístico colombiano de distribución, que genere estrategias que definan las condiciones para un mejor funcionamiento del mismo. El trabajo cuenta con las generalidades del proyecto, donde se sustentan las razones por las cuales existe la necesidad de este tipo de investigaciones en Colombia y los objetivos que se proponen lograr, seguido de una explicación de los conceptos claves y de la metodología que se aplica. A continuación, se inicia el desarrollo de la investigación con la identificación de las acciones que se llevan a cabo en la actualidad en miras de mejorar el desempeño logístico, seguido del diseño de las estrategias logísticas empleando un análisis estructural, conformando un espacio morfológico y evaluando las opciones con ayuda de un proceso analítico jerárquico