Font Size: a A A

Research On The Fairness Capacitated Vehicle Routing Problem Based On Variable Neighborhood Ant Colony Algorithm

Posted on:2014-02-22Degree:MasterType:Thesis
Country:ChinaCandidate:F PanFull Text:PDF
GTID:2249330392461552Subject:Logistics Engineering
Abstract/Summary:PDF Full Text Request
China has been one of the countries who have been severely sufferingfrom natural calamities, especially since the90s of last century. Economiclosses caused by natural disasters has increased these years remarkably.After disasters, it is crucial for disaster prevention and relief at the firsttime to set up disaster relief agency and transport urgent relief goods todifferent places in time.Emergency logistics refers to the special kind of logistics activity thatserves for urgent transportation needs of relief goods, and aims tominimize casualty loss. Compared with traditional logistics which aims tominimize transportation cost, emergency embodies the requirement oftimeliness on the basis transportation cost considerations. Meanwhile, asfairness is one of conspicuous issues, it has won more and more attentionby the public, especially in disaster relief. To stabilize victims and socialemotion, avoid emotional outburst caused by overtime waiting time andunfair distribution, Fairness is referred to an unprecedented level.According to the characteristics of emergency logistics, this paperproposes Fairness Capacitated Vehicle Routing Problem (FCVRP) models,based on two situations including adequate supplies situation and lackingsupplies situation, to meet the requirements of timeliness and fairness inemergency relief distribution. After property analysis of model andproblem, this paper puts forward a new algorithm, Variable NeighborhoodAnt Colony Algorithm (VNACA) which is based on Variable NeighborhoodSearch (VNS) and Ant Colony Optimization (ACO) and customized fromACO and VNS to solve FCVRP. Finally, a series of computational experiments is performed to verify effectiveness of new algorithm bycomparison with CPLEX, and evaluate the performance of VNACA bycomparison with the solutions from the heuristic are compared with ACO,ACO with2-opt. The comparison shows that the proposed heuristic is ableto obtain better result in a shorter computing time.
Keywords/Search Tags:Emergency Relief Distribution, Vehicle Routing Problem, Fairness, Variable Neighborhood Search
PDF Full Text Request
Related items