We can reformulate a vehicle routing problem (VRP) as an open shop scheduling problem (SSP) by representing visits as activities, vehicles as resources on the factory floor, and travel as set up costs between activities. In this paper we present two reformulations: from VRP to open shop, and the inverse, from SSP to VRP. Not surprisingly, VRP technology performs poorly on reformulated SSP’s, as...

The Sudoku Assistant app is an AI assistant that uses a combination of machine learning and constraint programming techniques, to interpret explain pen-and-paper scanned with smartphone. Although the demo about Sudoku, underlying techniques are equally applicable other solving problems like timetabling, scheduling, vehicle routing.

Transportation in economic systems such as services, production and distribution enjoys a special and important position and provides a significant portion of the country's gross domestic product. Improvements in transportation system mean improvements in the traveling routes and the elimination of unnecessary distances in any system. The Vehicle Routing Problem (VRP) is one of the practical co...

The paper considers multi agent approach and respective multi-agent system for resource allocation and scheduling within shipping logistics problem. A well known benchmark that is Vehicle Routing Problem with Time Windows is considered as a case study. The paper proposes an approach to the shipping logistics problem solving that includes auction-based resource allocation and scheduling, distrib...

The coming era of world has moved to an exceptional leading contest of innovations and inspiration. In this paper, an attempt has been made to find out a solution to ensure the safety of route to parents when their child is travelling to school and back to home. Recent years, spatial data and observed data, such as digital road map, traffic route, vehicle speed, recordings events and others are...

Vehicular Ad-Hoc Networks (VANETs) is a novel technology that has recently emerged and due to its swift changing topology and high mobility nature, it has become problematic to design an efficient routing protocol in VANETs’ amongst both moving and stationary units. Also, the existing routing algorithms are not very effective to satisfy all requirements of VANETs. This paper explores the need o...

The capacitated vehicle routing problem (CVRP) is an interesting combinatorial optimization task, which occurs frequently in real-world applications [28]. The problem deals with scheduling a fleet of vehicles to distribute goods between depots and customers. A set of routes for vehicles should be determined, which are in some sense optimal, e.g. the shortest or the cheapest. Certain constraints...