The Vehicle Routing Problem (VRP) is a well studied logistical problem along with its various variants such as VRP customer Time-Window (VRPTW). However, all the previously assume that vehicles are mostly same in terms of their capacity, location and home (depot). This study uses agent-based approach for solving VRPTW vehicle’s unique depot. to minimise number used main target. Other targets in...

The driver scheduling problem at Chinese electric multiple-unit train depots becomes more and difficult in practice is studied very little research. This paper focuses on defining, modeling, solving the depot which can determine size schedule simultaneously. To solve this problem, we first construct a time-space network based formulate as minimum-cost multi-commodity flow problem. We then devel...

0957-4174/$ see front matter 2011 Elsevier Ltd. A doi:10.1016/j.eswa.2011.03.077 ⇑ Corresponding author. Tel.: +90 212 3832868. E-mail addresses: [email protected] (G.N. Y (N.Ç. Demirel). In this paper, a new type of geometric shape based genetic clustering algorithm is proposed. A genetic algorithm based on this clustering technique is developed for the solution process of the multi-depot...

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 fin...

BACKGROUND Noncompliance is a major problem for patients with a psychotic disorder. Two important risk factors for noncompliance that have a severe negative impact on treatment outcomes are impaired illness insight and lack of motivation. Our cross-sectional study explored how they are related to each other and their compliance with depot medication. METHODS Interviews were conducted in 169 o...

Emission reductions could be achieved by replacing the single-depot mode with a multi-depot of vehicle routing. In our study, we identified situations under which multiple depots used to effectively reduce carbon emissions. We proposed branch-and-price (BAP) algorithm obtain an optimal solution for green routing problem. Based on BAP algorithm, accurately quantified emission reduction potential...