Meta-heuristic Approach to Solve Mixed Vehicle Routing Problem with Backhauls in Enterprise Information System of Service Industry

Meta-heuristic Approach to Solve Mixed Vehicle Routing Problem with Backhauls in Enterprise Information System of Service Industry

S. P. Anbuudayasankar (Amrita Vishwa Vidyapeetham, India), K. Ganesh (McKinsey & Company, India) and Tzong-Ru Lee (Amrita School of Engineering, India)
DOI: 10.4018/978-1-61692-852-0.ch608
OnDemand PDF Download:
$30.00
List Price: $37.50

Abstract

This chapter presents the development of simulated annealing (SA) for a health care application which is modeled as Single Depot Vehicle routing problem called Mixed Vehicle Routing Problem with Backhauls (MVRPB), an extension of Vehicle Routing Problem with Backhauls (VRPB). This variant involves both delivery and pick-up customers and sequence of visiting the customers is mixed. The entire pick-up load should be taken back to depot. The latest rapid advancement of meta-heuristics has shown that it can be applied in practice if they are personified in packaged information technology (IT) solutions along with the combination of a Supply Chain Management (SCM) application integrated with an enterprise resource planning (ERP) resulted to this decision support tool. This chapter provides empirical proof in sustain of the hypothesis, that a population extension of SA with supportive transitions leads to a major increase of efficiency and solution quality for MVRPB if and only if the globally optimal solution is located close to the center of all local optimal solutions.

Complete Chapter List

Search this Book:
Reset