Optimization of a Large-Scale Lunch Box Delivery System - A Simple, Serializable, Synchronous, Parallel Simulated Annealing, and Floyd-Warshall Approach

EasyChair Preprint no. 1623

Abstract

In this research article, we studied the large-scale, eco-friendly lunch box delivery system of Mumbai, and identified that it’s further possible to improve the collection and delivery processes by following new routes and evenly distributing the loads while collection, distribution and transportation of the lunch boxes. We propose implementing multiple depot vehicle routing concept for improving the lunchbox delivery system. We use a real-coded simple serializable set, synchronous, parallel simulated annealing algorithm for new routing paths and balancing the collection load decisions. And the Floyd-Warshall algorithm to find the shortest path between any two points. The novel results of this work gives the suggestions for better improvement of Large-Scale Lunch Box Delivery system by taking care of the issues, a) reduce the manpower needed to do the same job, b) provide service to places where it was earlies not feasible due to long-distance.

Keyphrases: Floyd-Warshall algorithm, Lunch Box Delivery, Multiple Depot Vehicle Routing Problem, Parallel Floyd-Warshall Algorithm, parallel simulated annealing, Serializable Synchronous Parallel Simulated Annealing Algorithm, Transportation, Vehicle Routing Problem

@Booklet{EasyChair:1623,
  author = {Suraj Patro and Motahar Reza},
  title = {Optimization of a Large-Scale Lunch Box Delivery System - A Simple, Serializable, Synchronous, Parallel Simulated Annealing, and Floyd-Warshall Approach},
  howpublished = {EasyChair Preprint no. 1623},

  year = {EasyChair, 2019}}