Modelling and solving logistical problems with combinatorial optimization: case Parmatic

Loading...
Thumbnail Image

URL

Journal Title

Journal ISSN

Volume Title

School of Business | Bachelor's thesis

Date

2017

Major/Subject

Mcode

Degree programme

Business Technology

Language

en

Pages

22

Series

Abstract

This paper deals with various logistical optimisation problems by modelling them with modified versions of, or problems related to, the Vehicle Routing Problem. The problem is modelled as an Asymmetrical Capacitated Vehicle Routing Problem with multiple vehicles, the number of vehicles being found from solving the Bin Packing Problem. First, a linear programming formulation is constructed. Then an object-oriented programming implementation is derived from the original formulation, and implemented into a tool used to solve an empirical case from a construction company. The tool used is a Java-based application developed by the author.

Description

Thesis advisor

Wallenius, Jyrki
Liesiö, Juuso

Keywords

combinatorial optimization, vehicle routing problem, practical application, linear programming

Other note

Citation