Yazar "Cetinkaya, Cihan" seçeneğine göre listele

Listeleniyor 1 - 2 / 2
  • Küçük Resim Yok
    Öğe
    The location routing problem with arc time windows for terror regions: a mixed integer formulation
    (TAYLOR & FRANCIS LTD, 2018) Cetinkaya, Cihan; Gokcen, Hadi; Karaoglan, Ismail
    In this paper, we introduce a new variant of Location Routing Problem with the name of "Location Routing Problem with Arc Time Windows" (LRP_ATW), which emerges from the need of "safe transportation" in terror zones. In this specific problem, there are "arc time windows" on the arcs (roads) for transferring the vehicles like trucks and articulated lorries which means that these roads can be used for a specific period of time during a day. Within the scope of this paper, the problem and assumptions are described, and a Mixed Integer Programming (MIP) formulation is developed to solve the problem. Bounds are also improved using valid inequalities. The quality of the formulation is measured using the test problems in the literature. Computational results show that the proposed MIP formulation gives good quality results in a short computation time.
  • Küçük Resim Yok
    Öğe
    Two-stage vehicle routing problem with arc time windows: A mixed integer programming formulation and a heuristic approach
    (ELSEVIER SCIENCE BV, 2013) Cetinkaya, Cihan; Karaoglan, Ismail; Gokcen, Hadi
    In this paper, we introduce a new variant of the Vehicle Routing Problem (VRP), namely the Two-Stage Vehicle Routing Problem with Arc Time Windows (TS_VRP_ATWs) which generally emerges from both military and civilian transportation. The TS_VRP_ATW is defined as finding the vehicle routes in such a way that each arc of the routes is available only during a predefined time interval with the objective of overall cost minimization. We propose a Mixed Integer Programming (MIP) formulation and a heuristic approach based on Memetic Algorithm (MA) to solve the TS_VRP_ATW. The qualities of both solution approaches are measured by using the test problems in the literature. Experimental results show that the proposed MIP formulation provides the optimal solutions for the test problems with 25 and 50 nodes, and some test problems with 100 nodes. Results also show that the proposed MA is promising quality solutions in a short computation time. (C) 2013 Elsevier B.V. All rights reserved.