The Multi-Depot Vehicle Routing Problem (MDVRP) is a generalization of the Single-Depot Vehicle Routing Problem (SDVRP) in which vehicle(s) start from multiple depots and return to their depots of origin at the end of their assigned tours. The traditional objective in MDVRP is to minimize the sum of all tour lengths, and existing literature handles this problem with a variety of assumptions and...

among numerous np-hard problems, the traveling salesman problem (tsp) has been one of the most explored, yet unknown one. even a minor modification changes the problem’s status, calling for a different solution. the generalized traveling salesman problem (gtsp)expands the tsp to a much more complicated form, replacing single nodes with a group or cluster of nodes, where the objective is to fi...

Aiming at the multi-depot heterogeneous vehicle routing problem under time-dependent road network and soft time window, considering fixed cost, window penalty cost transportation an optimization model of is established with objective minimizing distribution cost. According to characteristics problem, a hybrid genetic algorithm variable neighborhood search temporal–spatial distance designed. Cus...

The Capacitated Arc Routing Problem with Refill Points (CARP-RP) is a new variant of the Capacitated Arc Routing Problem (CARP). In a CARP situation, the vehicle servicing arcs has a finite capacity, and hence has to return to the depot or a secondary station to be refilled (or emptied). In contrast, in the CARP-RP, the vehicle servicing arcs must be refilled on the spot by using a second vehic...

In this paper, the researchers have made an attempt to address the problem of traffic network congestion to speed up the disaster response activity during a disaster. A dynamic environment is made up of static and moving obstacles. Each moving vehicle acts as a dynamic obstacle for other moving vehicle. There by increasing the network congestion. It is shown that the game theoretic model effect...

In this research discusses the problem of distributing goods from a depot to several customer locations minimize travel costs. The is solved by using Vehicle Routing Problem method. data used in secondary with 10 customers and one depot. aim form model that has been obtained determine optimal route based on formed. first step objective function problem, then constraints may occur. After formed,...

This paper mainly studies the resource allocation algorithm in LTEA two-tier network. First of all, the research background of LTE-A techniques and Game theory is introduced. Then a distributed algorithm based on coalitional formation Game for femtocell resource allocation and interference management is proposed, which mainly focuses on cooperative strategies to optimize the coalition utility. ...

Cooperative advertising is an agreement between a manufacturer and a retailer to share advertising cost at the local level. Previous studies have not investigated cooperative advertising for complementary products and their main focus was only on one good. In this paper, we study a two-echelon supply chain consisting of one manufacturer and one retailer with two complementary goods. The demand ...