The Vehicle Routing Problem

For more info about our services contact : help@bestpfe.com

Table of contents

1 Introduction 
1.1 Background
1.2 Long-term Goals
1.3 Project Goals
1.4 Outline
2 Problem Description 
2.1 Different Kinds of Vehicle Routing Problems
2.2 What Has Been Studied Before
2.2.1 Branch and Bound
2.2.2 Ant Colony Optimization
2.2.3 Genetic Algorithms
2.2.4 Hybrid
2.2.5 Financial Aspects
2.3 The Vehicle Routing Problem in this Project
2.4 Restrictions and Interpretation
2.5 Constraints
2.6 Objective Function
3 Search-Based Problem Solving 
3.1 Search Algorithms
3.2 PDDL
3.3 Versions of PDDL
3.4 LPG-td
3.4.1 PDDL Features
3.4.2 Planning
3.4.3 LPG-td Accomplishments
4 Implementation 
4.1 Domain File
4.1.1 Types
4.1.2 Predicates
4.1.3 Functions
4.1.4 Actions
4.2 Problem File
5 Evaluation 
5.1 Definitions
5.2 Different Planners
5.3 LPG-td Scaling
5.4 LPG-td Performance
5.5 LPG-td Relative Improvement
5.6 Case Study Problem
6 Conclusions 
7 Discussion 
7.1 Transport and Solving Problems
7.1.1 Choice of Planner
7.1.2 Understanding How the Planner Works Versus Usability .
7.1.3 Heuristics
7.1.4 Soft Constraints
7.1.5 Adaptivity of PDDL
7.2 Financial Aspects
7.2.1 Is There Anyone Interested in a Service Like This?
7.2.2 Sharing Profits and Resources Between Participants
7.2.3 How to Approach Companies in Best Fashion
7.2.4 Assumption of No Rivalry Among Participants
7.2.5 Financial Regulations and Laws Against Collaborations
8 Acknowledgements 
Bibliography