Minimizing waiting times in a route design problem with multiple use of a single vehicle

In this study we introduce a routing problem with multiple use of a single vehicle and service time in demand points (clients) with the aim of minimizing the sum of clients waiting time to receive service. This problem is relevant in the distribution of aid, in disaster stricken communities, in the recollection and/or delivery of perishable goods and personnel transportation, among other situations, where reaching clients to perform service, fast and fair, is a priority. We consider vehicle capacity and travel distance constraints which force multiple use of the vehicle in the planning horizon. This paper presents and compares two mixed integer formulations for this problem, based on a multi–level network.     

Heuristics for solving a capacitated multiple allocation hub location problem with application in German wagonload traffic

In this paper, we present a capacitated multiple allocation hub location problem, which arose from a network design problem in German wagonload traffic. We develop heuristic solution approaches based on local improvements. We solve the problem with the heuristics and CPLEX on test data sets provided by our partner Deutsche Bahn AG. The computational results are presented and compared.     

Banach空间中含间断项Sturm—Liouville问题的解

利用拟上下解方法和混合单调迭代法,研究了Banach空间中含间断项的非线性Sturm-liouville问题解的存在唯一性,并给出逼近解迭代序列的误差估计．     

On first-order discrete boundary value problems

This article analyzes a nonlinear system of first-order difference equations with periodic and non-periodic boundary conditions. Some sufficient conditions are presented under which: potential solutions to the equations will satisfy certain a priori bounds; and the equations will admit at least one solution. The methods involve new dynamic inequalities and use of Brouwer degree theory. The new results are compared with those featuring in the theory of solutions to boundary value problems for differential equations.