|
|
|
|
|
Milos Seda
The assignment problem is a problem that takes many forms in optimization and graph theory, and by changing some of the constraints or interpreting them differently and adding other constraints, it can be converted to routing, distribution, and schedulin...
ver más
|
|
|
|
|
|
|
|
|
|
|
Ryo Matsuoka, Koichi Kobayashi and Yuh Yamashita
A pickup and delivery problem by multiple agents has many applications, such as food delivery service and disaster rescue. In this problem, there are cases where fuels must be considered (e.g., the case of using drones as agents). In addition, there are ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Amirreza Nickkar and Young-Jae Lee
In many states in the United States, school bus fleets are assigned to serve students sequentially at three levels?high school, middle school, and elementary school; however, in past studies, each of these stages in the problem was considered separately....
ver más
|
|
|
|
|
|
|
|
|
|
|
Antonino Vitetta
Given two pick-up and delivery points, the best path chosen does not necessarily follow the criteria of minimum travel time or generalized minimum cost evaluated with a deterministic approach. Given a criterion, the perceived cost is not deterministic fo...
ver más
|
|
|
|
|
|
|
|
|
|
|
Bashar Talib Al-Nuaimi, H.K. Al-Mahdawi, Zainalabideen Albadran, Hussein Alkattan, Mostafa Abotaleb and El-Sayed M. El-kenawy
The boundary value problem, BVP, for the PDE heat equation is studied and explained in this article. The problem declaration comprises two intervals; the (0, T) is the first interval and labels the heating of the inside burning chamber, and the second (T...
ver más
|
|
|
|
|
|
|
|
|
|
|
Chao-Feng Gao, Zhi-Hua Hu and Yao-Zong Wang
The hub-and-spoke network (HSN) design generally assumes direct transportation between a spoke node and its assigned hub, while the spoke?s demand may be far less than a truckload. Therefore, the total number of trucks on the network increases unnecessar...
ver más
|
|
|
|
|
|
|
|
|
|
|
Stephen A. Adubi, Olufunke O. Oladipupo and Oludayo O. Olugbara
Hyper-heuristics are widely used for solving numerous complex computational search problems because of their intrinsic capability to generalize across problem domains. The fair-share iterated local search is one of the most successful hyper-heuristics fo...
ver más
|
|
|
|
|
|
|
|
|
|
|
Yanqing Xu, Yue Zhang, Cong Fu, Xiyue Deng and Yihe Yang
Improved street lighting can provide better use of public space and helps to promote safety while driving or walking. In terms of balancing benefits and impacts, on the basis of cost saving, this research adopts two prominent mathematical models, the max...
ver más
|
|
|
|
|
|
|
|
|
|
|
Meixian Jiang, Jian Zhou, Jiajia Feng, Lin Zhou, Fangzheng Ma and Guanghua Wu
In this work, we study the integrated berth and crane scheduling problem in a tidal port with multiple terminals, considering the uncertainties, tides, maximum coverage of cranes and interference between cranes. For coping with the uncertainties, a certa...
ver más
|
|
|
|
|
|
|
|
|
|
|
Dong Yin, Yifeng Niu, Jian Yang and Shaobo Yu
In this paper, we study the static discrete berth allocation problems (BAPs) for large-scale time-critical marine-loading scenarios. The objective is to allocate the vessels to different types of berths so that all the vessels can be loaded within the mi...
ver más
|
|
|
|
|
|
|
|
|
|
|
Priyanka Mukhopadhyay
In this work, we give provable sieving algorithms for the Shortest Vector Problem (SVP) and the Closest Vector Problem (CVP) on lattices in l??
l
p
norm (1=??=8
1
=
p
=
8
). The running time we obtain is better than existing provable sieving algorithms....
ver más
|
|
|
|
|
|
|
|
|
|
|
Kunihiko Hiraishi
In a previous paper by the author, a pathfinding problem for directed trees is studied under the following situation: each edge has a nonnegative integer length, but the length is unknown in advance and should be found by a procedure whose computational ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Ahmad Kholiqul Amin,I Nyoman Degeng Sudana,Punaji Setyosari,Ery Tri Djatmika
Pág. pp. 119 - 141
This study aimed to examine the effectiveness of mobile blended compared to conventional problem-based learning on mathematical problem-solving skills and look for students' responses about the use of online learning. The study was conducted using a pret...
ver más
|
|
|
|
|
|
|
|
|
|
|
Hiroshi Arai and Harumi Haraguchi
We proposed the method that translates the two-dimensional CSP for minimizing the number of cuts to the Ising model. After that, we conducted computer experiments of the proposed model using the benchmark problem. From the above, the following results ar...
ver más
|
|
|
|
|
|
|
|
|
|
|
Christoph Hansknecht, Imke Joormann and Sebastian Stiller
The time-dependent traveling salesman problem (TDTSP) asks for a shortest Hamiltonian tour in a directed graph where (asymmetric) arc-costs depend on the time the arc is entered. With traffic data abundantly available, methods to optimize routes with res...
ver más
|
|
|
|
|
|
|
|
|
|
|
Parfait Atchade-Adelomou, Guillermo Alonso-Linaje, Jordi Albo-Canals and Daniel Casado-Fauli
This article aims to bring quantum computing to robotics. A quantum algorithm is developed to minimize the distance traveled in warehouses and distribution centers where order picking is applied. For this, a proof of concept is proposed through a Raspber...
ver más
|
|
|
|
|
|
|
|
|
|
|
Xuelian Pang, Haoran Xue, Ming-Lang Tseng, Ming K. Lim and Kaihua Liu
Prior studies are lacking which address permutation flow shop scheduling problems and hybrid flow shop scheduling problems together to help firms find the optimized scheduling strategy. The permutation flow shop scheduling problem and hybrid flow shop sc...
ver más
|
|
|
|
|
|
|
|
|
|
|
Lyudmila Chernova,Sergiy Titov,Sergii Chernov,Kateryna Kolesnikova,Liubava Chernova,Viktor Gogunskii
Pág. 28 - 36
The rigorous formal algorithm for formulating a dual problem for different forms (general, basic, standard, and canonical) of a primal linear programming problem is proposed. First, definitions of a pair of dual problems for standard form of primal linea...
ver más
|
|
|
|
|
|
|
|
|
|
|
Meghann Mears and Paul Brindley
Urban greenspace can provide physical and mental health benefits to residents, potentially reducing health inequalities associated with socioeconomic deprivation. The distribution of urban greenspace is an important social justice issue, and consequently...
ver más
|
|
|
|
|
|
|
|
|
|
|
Siti Noor Asyikin Mohd Razali,Nabeel Naeem Hasan Almaalei
The ant colony optimization algorithm is based on the behaviour of real ants. This algorithm was introduced in the 1990s with the aim of finding solutions to problems which simulates the decision-making processes through the use of ants artificial. This ...
ver más
|
|
|
|
|
|