scholarly journals On the periodic hierarchical Chinese postman problem

2021 ◽  
Author(s):  
Muhammed Emre Keskin ◽  
Chefi Triki
Keyword(s):  
Integer Programming ◽  
Time Horizon ◽  
Programming Model ◽  
Mathematical Formulation ◽  
General Purpose ◽  
Chinese Postman Problem ◽  
New Variant ◽  
Chinese Postman ◽  
High Level ◽  
First Time

AbstractThis paper presents a mathematical formulation and a heuristic approach for a new variant of the Hierarchical Chinese Postman Problem (HCPP). Indeed, we introduce the concept of periodicity, and we define and solve, for the first time, the Periodic-HCPP, denoted as P-HCPP. Given that the resulting integer programming model makes use of a big number of binary variables and given the extended time horizon considered, 30 days in our case, the problem is characterized by a high level of complexity. However, our developed heuristic is able to solve instances having up to 40 nodes, 520 arcs and 5 hierarchies, whereas a general-purpose solver like Gurobi was not able to provide solutions for instances having more than 10 nodes. While the collected results are very encouraging, we provide at the end of this paper a set of possible future extensions of this work.

scholarly journals THE WARSHIP ASSIGNMENT SCHEDULE USING INTEGER PROGRAMMING MODEL

JOURNAL ASRO ◽  
2019 ◽  
Vol 10 (3) ◽  
pp. 49
Author(s):  
Ahmadi Ahmadi ◽  
Benny Sukandari ◽  
Agus Mahrowi
Keyword(s):  
Integer Programming ◽  
Programming Model ◽  
Mathematical Formulation ◽  
Combinatorial Problem ◽  
Mathematical Methods ◽  
Alternative Scheduling ◽  
Integer Programming Model ◽  
Maintenance Schedule ◽  
Hard Constraints ◽  
Decision Variables

Scheduling is an assignment activity that deals with constraints. A number of events can occur in a period of time and location so that objective functions as close as possible can be fulfilled. In the hierarchy of decision making, scheduling is the last step before the start of an operation. Scheduling warship assignments in Kolinlamil are an interesting topic to discuss and find solutions to using mathematical methods. The process of the Kolinlamil warship assignment schedule was carried out to produce an annual shipbuilding schedule. This process not only requires fast follow-up, but also requires systematic and rigorous steps. Where the assignment schedule is a fairly complex combinatorial problem. While making the assignment schedule that is applied at this time is considered less accurate because it calculates the conventional method. The process of warship assignment schedule in this study using the Integer Programming model aims to obtain alternative scheduling operations. The schedule observed was 13 warships in carrying out N operations for 1 year (52 weeks). This research begins with determining the decision variables and limitations that existing constraints. Hard constraints include: maintenance schedule, time and duration of each task, warship class assigned to the task and the number of executing warships per task. While soft constraints are how long the warship performs its tasks in a row. The mathematical formulation of the Integer Programming model created consists of three indicator, one decision variables, two measuring parameters and five constraint functions. Furthermore, determining the best scheduling alternatives is completed using the Microsoft Exel Solver computing program.Keywords: Scheduling, Integer Programming, Solver.

scholarly journals A bi-objective integer programming model for locating garbage accumulation points: a case study

2019 ◽  
pp. 70-81
Author(s):  
Diego Gabriel Rossit ◽  
Sergio Nesmachnow ◽  
Jamal Toutouh
Keyword(s):  
Integer Programming ◽  
Local Governments ◽  
Programming Model ◽  
Mathematical Formulation ◽  
Msw Management ◽  
Accumulation Points ◽  
Starting Point ◽  
Support Tools ◽  
The City

Enhancing efficiency in Municipal Solid Waste (MSW) management is crucial for local governments, which are generally in charge of collection, since this activity explains a large proportion of their budgetary expenses. The incorporation of decision support tools can contribute to improve the MSW system, specially by reducing the required investment of funds. This article proposes a mathematical formulation, based on integer programming, to determine the location of garbage accumulation points while minimizing the expenses of the system, i.e., the installment cost of bins and the required number of visits the collection vehicle which is related with the routing cost of the collection. The model was tested in some scenarios of an important Argentinian city that stills has a door-to-door system, including instances with unsorted waste, which is the current situation of the city, and also instances with source classified waste. Although the scenarios with classified waste evidenced to be more challenging for the proposed resolution approach, a set of solutions was provided in all scenarios. These solutions can be used as a starting point for migrating from the current door-to-door system to a community bins system.

scholarly journals Traveling salesman problem: approach to optimality

2014 ◽  
Vol 15 (2) ◽  
pp. 157-169
Author(s):  
Radosław Jadczak
Keyword(s):  
Traveling Salesman Problem ◽  
Vehicle Routing Problem ◽  
Decision Problem ◽  
Mathematical Formulation ◽  
Traveling Salesman ◽  
Chinese Postman Problem ◽  
Routing Problem ◽  
Solution Strategies ◽  
Chinese Postman ◽  
Single Vehicle

Abstract Traveling Salesman Problem (TSP) is a basic and one of the most important transportation problems in operational logistics. It is also known in the literature as a Chinese postman problem or single vehicle routing problem. TSP can be shortly described as follows. Vehicle starting from the selected city must visit a set of another cities exactly once and return to the starting city in such a way that the total distance of the route is minimized. In this paper first mathematical formulation of decision problem is presented. Then solution strategies of TSP are shown with selected algorithms as examples. In the last part of article, a computational results of selected methods are presented.

scholarly journals Solution Strategies for a Multiport Container Ship Stowage Problem

2019 ◽  
Vol 2019 ◽  
pp. 1-12 ◽  
Author(s):  
Consuelo Parreño-Torres ◽  
Ramon Alvarez-Valdes ◽  
Francisco Parreño
Keyword(s):  
Integer Programming ◽  
Computational Analysis ◽  
Programming Model ◽  
Programming Models ◽  
Container Ship ◽  
Computational Results ◽  
Solution Strategies ◽  
Large Size ◽  
Loading And Unloading ◽  
First Time

The multiport container ship stowage problem consists in determining the position of the containers on board a ship along its route with the objective of minimizing the number of unproductive moves required in the loading and unloading operations at each port. This paper presents an integer programming model for the problem and proposes several sets of valid constraints that bring its LP-relaxation closer to an integer solution. Moreover, it presents a GRASP algorithm that generates stowage plans with a minimal number of unproductive moves in a high percentage of medium and large-size instances. An extended computational analysis has been performed in which, to the best of the authors’ knowledge, the efficiency of integer programming models for the problem is tested for the first time. With respect to GRASP, the computational results show that it performs well on different sized datasets.

Computing Gamma Calculus on Computer Cluster

2012 ◽  
pp. 2016-2026
Author(s):  
Hong Lin ◽  
Jeremy Kemp ◽  
Padraic Gilbert
Keyword(s):  
Gpu Computing ◽  
Programming Model ◽  
Large Data ◽  
General Purpose ◽  
Tuple Space ◽  
Data Set ◽  
Cuda Architecture ◽  
High Level ◽  
General Purpose Gpu ◽  
Grid Cluster

Gamma Calculus is an inherently parallel, high-level programming model, which allows simple programming molecules to interact, creating a complex system with minimum of coding. Gamma calculus modeled programs were written on top of IBM’s TSpaces middleware, which is Java-based and uses a “Tuple Space” based model for communication, similar to that in Gamma. A parser was written in C++ to translate the Gamma syntax. This was implemented on UHD’s grid cluster (grid.uhd.edu), and in an effort to increase performance and scalability, existing Gamma programs are being transferred to Nvidia’s CUDA architecture. General Purpose GPU computing is well suited to run Gamma programs, as GPU’s excel at running the same operation on a large data set, potentially offering a large speedup.

Computing Gamma Calculus on Computer Cluster

2012 ◽  
pp. 275-286
Author(s):  
Hong Lin ◽  
Jeremy Kemp ◽  
Padraic Gilbert
Keyword(s):  
Gpu Computing ◽  
Programming Model ◽  
Large Data ◽  
General Purpose ◽  
Tuple Space ◽  
Data Set ◽  
Cuda Architecture ◽  
High Level ◽  
General Purpose Gpu ◽  
Grid Cluster

Gamma Calculus is an inherently parallel, high-level programming model, which allows simple programming molecules to interact, creating a complex system with minimum of coding. Gamma calculus modeled programs were written on top of IBM’s TSpaces middleware, which is Java-based and uses a “Tuple Space” based model for communication, similar to that in Gamma. A parser was written in C++ to translate the Gamma syntax. This was implemented on UHD’s grid cluster (grid.uhd.edu), and in an effort to increase performance and scalability, existing Gamma programs are being transferred to Nvidia’s CUDA architecture. General Purpose GPU computing is well suited to run Gamma programs, as GPU’s excel at running the same operation on a large data set, potentially offering a large speedup.

Computing Gamma Calculus on Computer Cluster

2010 ◽  
Vol 1 (4) ◽  
pp. 42-52 ◽  
Author(s):  
Hong Lin ◽  
Jeremy Kemp ◽  
Padraic Gilbert
Keyword(s):  
Gpu Computing ◽  
Programming Model ◽  
Large Data ◽  
General Purpose ◽  
Tuple Space ◽  
Data Set ◽  
Computer Cluster ◽  
Cuda Architecture ◽  
High Level ◽  
General Purpose Gpu

Gamma Calculus is an inherently parallel, high-level programming model, which allows simple programming molecules to interact, creating a complex system with minimum of coding. Gamma calculus modeled programs were written on top of IBM’s TSpaces middleware, which is Java-based and uses a “Tuple Space” based model for communication, similar to that in Gamma. A parser was written in C++ to translate the Gamma syntax. This was implemented on UHD’s grid cluster (grid.uhd.edu), and in an effort to increase performance and scalability, existing Gamma programs are being transferred to Nvidia’s CUDA architecture. General Purpose GPU computing is well suited to run Gamma programs, as GPU’s excel at running the same operation on a large data set, potentially offering a large speedup.

A Confrontation between Two Doctrines: The Birth of Struggle for Hegemony in Hebrew Children's Literature during the 1930s and 1940s

2008 ◽  
Vol 1 (2) ◽  
pp. 139-155 ◽  
Author(s):  
YAEL DARR
Keyword(s):  
Children's Literature ◽  
Educational System ◽  
Single Channel ◽  
Children’S Literature ◽  
The Political ◽  
Literary Creation ◽  
History Of ◽  
High Level ◽  
First Time ◽  
Literary Quality

This article describes a crucial and fundamental stage in the transformation of Hebrew children's literature, during the late 1930s and 1940s, from a single channel of expression to a multi-layered polyphony of models and voices. It claims that for the first time in the history of Hebrew children's literature there took place a doctrinal confrontation between two groups of taste-makers. The article outlines the pedagogical and ideological designs of traditionalist Zionist educators, and suggests how these were challenged by a group of prominent writers of adult poetry, members of the Modernist movement. These writers, it is argued, advocated autonomous literary creation, and insisted on a high level of literary quality. Their intervention not only dramatically changed the repertoire of Hebrew children's literature, but also the rules of literary discourse. The article suggests that, through the Modernists’ polemical efforts, Hebrew children's literature was able to free itself from its position as an apparatus controlled by the political-educational system and to become a dynamic and multi-layered field.

Sign in / Sign up

Export Citation Format

Share Document