3,383 research outputs found

    Optimizing Urban Distribution Routes for Perishable Foods Considering Carbon Emission Reduction

    Get PDF
    The increasing demand for urban distribution increases the number of transportation vehicles which intensifies the congestion of urban traffic and leads to a lot of carbon emissions. This paper focuses on carbon emission reduction in urban distribution, taking perishable foods as the object. It carries out optimization analysis of urban distribution routes to explore the impact of low carbon policy on urban distribution routes planning. On the base of analysis of the cost components and corresponding constraints of urban distribution, two optimization models of urban distribution route with and without carbon emissions cost are constructed, and fuel quantity related to cost and carbon emissions in the model is calculated based on traffic speed, vehicle fuel quantity and passable time period of distribution. Then an improved algorithm which combines genetic algorithm and tabu search algorithm is designed to solve models. Moreover, an analysis of the influence of carbon tax price is also carried out. It is concluded that in the process of urban distribution based on the actual network information, the path optimization considering the low carbon factor can effectively reduce the distribution process of CO2, and reduce the total cost of the enterprise and society, thus achieving greater social benefits at a lower cost. In addition, the government can encourage low-carbon distribution by rationally adjusting the price of carbon tax to achieve a higher social benefit

    A fuzzy-based prediction approach for blood delivery using machine learning and genetic algorithm

    Get PDF
    Multiple diseases require a blood transfusion on daily basis. The process of a blood transfusion is successful when the type and amount of blood is available and when the blood is transported at the right time from the blood bank to the operating room. Blood distribution has a large portion of the cost in hospital logistics. The blood bank can serve various hospitals; however, amount of blood is limited due to donor shortage. The transportation must handle several requirements such as timely delivery, vibration avoidance, temperature maintenance, to keep the blood usable. In this paper, we discuss in first section the issues with blood delivery and constraint. The second section present routing and scheduling system based on artificial intelligence to deliver blood from the blood-banks to hospitals based on single blood bank and multiple blood banks with respect of the vehicle capacity used to deliver the blood and creating the shortest path. The third section consist on solution for predicting the blood needs for each hospital based on transfusion history using machine learning and fuzzy logic. The last section we compare the results of well-known solution with our solution in several cases such as shortage and sudden changes

    A robust solving strategy for the vehicle routing problem with multiple depots and multiple objectives

    Get PDF
    This document presents the development of a robust solving strategy for the Vehicle Routing Problem with Multiple Depots and Multiple Objectives (MO-MDVRP). The problem tackeled in this work is the problem to minimize the total cost and the load imbalance in vehicle routing plan for distribution of goods. This thesis presents a MILP mathematical model and a solution strategy based on a Hybrid Multi- Objective Scatter Search Algorithm. Several experiments using simulated instances were run proving that the proposed method is quite robust, this is shown in execution times (less than 4 minutes for an instance with 8 depots and 300 customers); also, the proposed method showed good results compared to the results found with the MILP model for small instances (up to 20 clients and 2 depots).MaestríaMagister en Ingeniería Industria

    Integrated and periodic relief logistics planning for reaction phase in uncertainty condition and model solving by particles swarm optimization algorithm

    Get PDF
    Disaster relief logistics is considered to be one of the major activities in disaster management. This research studies response phase of the disaster management cycle. To do so, a multi-purpose integrated model for a three-level relief cycle logistics is provided under an uncertainty condition and on a periodic basis. In this model, inventory transfer, vehicle routing, distribution and sending relief goods are modeled on a periodic basis. In addition, in order to solve the proposed mathematical model, ultra-initiative particles swarm algorithm in combination with variable neighborhood search based on Pareto archive is proposed. To prove the efficiency of the proposed particles swarm algorithm, several sample problems are randomly selected considering the solved problems in the literature and are solved by particles swarm algorithm. These problems are also solved by genetic algorithm and the results obtained from these two algorithms are compared in terms of quality, dispersion and integrity indices. The results show that compared to genetic algorithm, particles swarm algorithm is more capable of producing more integrated, qualified and dispersed responses. Moreover, the results show that the solution time of genetic algorithm is less than that of the proposed algorithm

    Integrated and periodic relief logistics planning for reaction phase in uncertainty condition and model solving by particles swarm optimization algorithm

    Get PDF
    Disaster relief logistics is considered to be one of the major activities in disaster management. This research studies response phase of the disaster management cycle. To do so, a multi-purpose integrated model for a three-level relief cycle logistics is provided under an uncertainty condition and on a periodic basis. In this model, inventory transfer, vehicle routing, distribution and sending relief goods are modeled on a periodic basis. In addition, in order to solve the proposed mathematical model, ultra-initiative particles swarm algorithm in combination with variable neighborhood search based on Pareto archive is proposed. To prove the efficiency of the proposed particles swarm algorithm, several sample problems are randomly selected considering the solved problems in the literature and are solved by particles swarm algorithm. These problems are also solved by genetic algorithm and the results obtained from these two algorithms are compared in terms of quality, dispersion and integrity indices. The results show that compared to genetic algorithm, particles swarm algorithm is more capable of producing more integrated, qualified and dispersed responses. Moreover, the results show that the solution time of genetic algorithm is less than that of the proposed algorithm

    Survey on Ten Years of Multi-Depot Vehicle Routing Problems: Mathematical Models, Solution Methods and Real-Life Applications

    Get PDF
    A crucial practical issue encountered in logistics management is the circulation of final products from depots to end-user customers. When routing and scheduling systems are improved, they will not only improve customer satisfaction but also increase the capacity to serve a large number of customers minimizing time. On the assumption that there is only one depot, the key issue of distribution is generally identified and formulated as VRP standing for Vehicle Routing Problem. In case, a company having more than one depot, the suggested VRP is most unlikely to work out. In view of resolving this limitation and proposing alternatives, VRP with multiple depots and multi-depot MDVRP have been a focus of this paper. Carrying out a comprehensive analytical literature survey of past ten years on cost-effective Multi-Depot Vehicle Routing is the main aim of this research. Therefore, the current status of the MDVRP along with its future developments is reviewed at length in the paper

    Optimization of Location-Routing for the Waste Household Appliances Recycling Logistics under the Uncertain Condition

    Get PDF
    Waste household appliances and electronic products usually contain harmful substances which need scientific and reasonable collection, classification, processing, recovery and disposal to achieve sustainable and effective recycling and utilization. In recent years, due to the poor management of waste household appliances recycling logistics system, safety accidents occur frequently, which seriously harm the health and life safety of the society. This paper studies the risk management of recycling waste household appliances under uncertain conditions and establishes a risk measurement model under fuzzy population density. Considering the multi-stage and classification diversity of waste household appliances recycling logistics, the multi-objective location routing model and location - routing model are established respectively. Based on the model complexity analysis, the solution method of multi-objective model is designed. Finally, the validity of the model and algorithm is verified by examples and tests

    Fleet dimensioning and scheduling in the Brazilian ethanol industry: a fuzzy logic approach

    Get PDF
    This work solves a real-world multi-depot vehicle routing problem (MDVRP) with a homogeneous fleet and capacitated depots. A pipeline company wants to establish a vehicle policy in order to own part of its fleet and serve its customers for a period of one year. The company also wants to know the schedule of the visits for collecting ethanol from 261 producers and taking it to their three terminals located in Brazil. This problem presents uncertain demand, since weather conditions impact the final crop and uncertain depot capacity. Due to the vagueness of managers’ speech, this problem also presents uncertain travel time. In this paper, fuzzy logic is used to model uncertainty and vagueness and to split the initial instance into smaller ones. Besides solving a real-world problem with fuzzy demand, fuzzy depot capacity and fuzzy travel time, this paper contributes with a decision making tool that reports different solutions for different uncertainty levels.Este trabalho resolve um problema de roteamento de veículos multi-depósito do mundo real (MDVRP) com frota homogênea e depósitos capacitados. Uma empresa de pipeline deseja estabelecer uma política de veículos para possuir parte de sua frota e atender seus clientes por um período de um ano. A empresa também quer saber o agendamento das visitas para coleta de etanol de 261 produtores e retirada para seus três terminais localizados no Brasil. Este problema apresenta incertezas de demanda, já que as condições climáticas impactam a safra final e depósito de capacidade incerta. Devido à imprecisão do discurso dos gerentes, este problema também apresenta tempo de viagem incerto. Neste artigo, a lógica fuzzy é usada para modelar a incerteza e vagueza e dividir a instância inicial em outras menores. Além de resolver um problema do mundo real com demanda difusa, capacidade de depósito difusa e tempo de viagens difusas, este artigo contribui com uma ferramenta de tomada de decisão que relata diferentes soluções para diferentes níveis de incerteza

    Development of transportation and supply chain problems with the combination of agent-based simulation and network optimization

    Get PDF
    Demand drives a different range of supply chain and logistics location decisions, and agent-based modeling (ABM) introduces innovative solutions to address supply chain and logistics problems. This dissertation focuses on an agent-based and network optimization approach to resolve those problems and features three research projects that cover prevalent supply chain management and logistics problems. The first case study evaluates demographic densities in Norway, Finland, and Sweden, and covers how distribution center (DC) locations can be established using a minimizing trip distance approach. Furthermore, traveling time maps are developed for each scenario. In addition, the Nordic area consisting of those three countries is analyzed and five DC location optimization results are presented. The second case study introduces transportation cost modelling in the process of collecting tree logs from several districts and transporting them to the nearest collection point. This research project presents agent-based modelling (ABM) that incorporates comprehensively the key elements of the pick-up and delivery supply chain model and designs the components as autonomous agents communicating with each other. The modelling merges various components such as GIS routing, potential facility locations, random tree log pickup locations, fleet sizing, trip distance, and truck and train transportation. The entire pick-up and delivery operation are modeled by ABM and modeling outcomes are provided by time series charts such as the number of trucks in use, facilities inventory and travel distance. In addition, various scenarios of simulation based on potential facility locations and truck numbers are evaluated and the optimal facility location and fleet size are identified. In the third case study, an agent-based modeling strategy is used to address the problem of vehicle scheduling and fleet optimization. The solution method is employed to data from a real-world organization, and a set of key performance indicators are created to assess the resolution's effectiveness. The ABM method, contrary to other modeling approaches, is a fully customized method that can incorporate extensively various processes and elements. ABM applying the autonomous agent concept can integrate various components that exist in the complex supply chain and create a similar system to assess the supply chain efficiency.Tuotteiden kysyntä ohjaa erilaisia toimitusketju- ja logistiikkasijaintipäätöksiä, ja agenttipohjainen mallinnusmenetelmä (ABM) tuo innovatiivisia ratkaisuja toimitusketjun ja logistiikan ongelmien ratkaisemiseen. Tämä väitöskirja keskittyy agenttipohjaiseen mallinnusmenetelmään ja verkon optimointiin tällaisten ongelmien ratkaisemiseksi, ja sisältää kolme tapaustutkimusta, jotka voidaan luokitella kuuluvan yleisiin toimitusketjun hallinta- ja logistiikkaongelmiin. Ensimmäinen tapaustutkimus esittelee kuinka käyttämällä väestötiheyksiä Norjassa, Suomessa ja Ruotsissa voidaan määrittää strategioita jakelukeskusten (DC) sijaintiin käyttämällä matkan etäisyyden minimoimista. Kullekin skenaariolle kehitetään matka-aikakartat. Lisäksi analysoidaan näistä kolmesta maasta koostuvaa pohjoismaista aluetta ja esitetään viisi mahdollista sijaintia optimointituloksena. Toinen tapaustutkimus esittelee kuljetuskustannusmallintamisen prosessissa, jossa puutavaraa kerätään useilta alueilta ja kuljetetaan lähimpään keräyspisteeseen. Tämä tutkimusprojekti esittelee agenttipohjaista mallinnusta (ABM), joka yhdistää kattavasti noudon ja toimituksen toimitusketjumallin keskeiset elementit ja suunnittelee komponentit keskenään kommunikoiviksi autonomisiksi agenteiksi. Mallinnuksessa yhdistetään erilaisia komponentteja, kuten GIS-reititys, mahdolliset tilojen sijainnit, satunnaiset puunhakupaikat, kaluston mitoitus, matkan pituus sekä monimuotokuljetukset. ABM:n avulla mallinnetaan noutojen ja toimituksien koko ketju ja tuloksena saadaan aikasarjoja kuvaamaan käytössä olevat kuorma-autot, sekä varastomäärät ja ajetut matkat. Lisäksi arvioidaan erilaisia simuloinnin skenaarioita mahdollisten laitosten sijainnista ja kuorma-autojen lukumäärästä sekä tunnistetaan optimaalinen toimipisteen sijainti ja tarvittava autojen määrä. Kolmannessa tapaustutkimuksessa agenttipohjaista mallinnusstrategiaa käytetään ratkaisemaan ajoneuvojen aikataulujen ja kaluston optimoinnin ongelma. Ratkaisumenetelmää käytetään dataan, joka on peräisin todellisesta organisaatiosta, ja ratkaisun tehokkuuden arvioimiseksi luodaan lukuisia keskeisiä suorituskykyindikaattoreita. ABM-menetelmä, toisin kuin monet muut mallintamismenetelmät, on täysin räätälöitävissä oleva menetelmä, joka voi sisältää laajasti erilaisia prosesseja ja elementtejä. Autonomisia agentteja soveltava ABM voi integroida erilaisia komponentteja, jotka ovat olemassa monimutkaisessa toimitusketjussa ja luoda vastaavan järjestelmän toimitusketjun tehokkuuden arvioimiseksi yksityiskohtaisesti.fi=vertaisarvioitu|en=peerReviewed
    corecore