Künstliche Intelligenz (KI) und Machine Learning (ML) gelten gegenwärtig als probate Mittel, um betriebswirtschaftliche Entscheidungen durch mathematische Modelle zu optimieren. Allerdings werden die Technologien häufig in Form von "Black Box"-Ansätze mit entsprechenden Risiken realisiert....

In this paper we propose two cooperation schemes to compose new parallel variants of the Variable Neighborhood Search (VNS). On the one hand, a coarse-grained cooperation scheme is introduced which is well suited for being enhanced with a solution warehouse to store and manage the so far best...

In reverse logistics networks, products (e.g., bottles or containers) have to be transported from a depot to customer locations and, after use, from customer locations back to the depot. In order to operate economically beneficial, companies prefer a simultaneous delivery and pick-up service....

This paper addresses a drayage problem, which is motivated by the case study of a real carrier. Its trucks carry one or two containers from a port to importers and from exporters to the port. Since up to four customers can be served in each route, we propose a set-covering formulation for this...

Transportation is one of the post-harvest activities in which perishable food products may suffer mechanical damage, which translates into a substantial loss of quality and product value. The main source of this type of damage in transportation is vibration, influenced, among others factors, by...

Purpose: Aim at choosing a relative good vehicle routing in emergency conditions under constraint conditions when disaster happens. Rapid response and rescue can save a lot of people. Design/methodology/approach: Modeling analysis: establishing a mathematical model of multi-objective emergency...

Purpose: We consider a real case study of a vehicle routing problem with a heterogeneous fleet and time windows (HFVRPTW) for a franchise company bottling Coca-Cola products in Colombia. This study aims to determine the routes to be performed to fulfill the demand of the customers by using a...

The NP-hard Vehicle Routing Problem (VRP) is central in the optimisation of distribution networks. Its main objective is to determine a set of vehicle trips of minimum total cost. The ideal schedule will efficiently exploit the company's recourses, service all customers and satisfy the given...

This research addresses the problem of planning tourism routes and finding appropriate shopping (market place) locations for agricultural product transportation. Generally, tourists visit popular tourism attractions; and generally, unpopular tourism attractions do not stimulate the economy,...