Process planning and scheduling are two of the most important functions in the manufacturing system. Traditionally, process planning and scheduling were regarded as separate tasks performed sequentially, where scheduling was implemented after process plans had been generated. However, their...

The lot-streaming flow shop scheduling problem plays an important role in modern industry. This paper addresses this problem with the objective of minimizing the total weighted earliness and tardiness penalties and then proposes a simple but effective iterated local search (ILS) algorithm. In...

In this study, we present empirical analysis of statistical properties of mating networks in genetic algorithms (GAs). Under the framework of GAs, we study a class of interaction network model—information flux network (IFN), which describes the information flow among generations during...

<title>Abstract</title> Many equilibrium models and algorithms based on homogeneous motorized traffic have been devised to model urban transport systems in developed countries, but they are inadequate when it comes to represent mixed-traffic urban transport systems, including automobiles, transit, bicycles,...

Phenomenon of asymmetry between odd and even node weight distribution in some complex networks, such as public transportation networks and Internet, is presented. Reasons related to this phenomenon are summarized, i.e., (1) edges are solid connections between nodes which are embedded in real...

In order to take the weight of connection into consideration and to find a natural measurement of weight, we have collected papers in Econophysics and constructed a network of scientific communication to integrate idea transportation among econophysicists by collaboration, citation and personal...

Previous studies show that the center of a geographic space is of great importance in urban and regional studies, including study of population distribution, urban growth modeling, and scaling properties of urban systems, etc. But how to well define and how to efficiently extract the center of a...

Many algorithms have been presented to solve the traffic assignment problem. Recently, Bar-Gera introduced the concept of “last common node” into an origin-based algorithm to solve the traffic assignment problem. However, how to find the last common nodes has not been investigated in detail....

Minimax problems can be approached by reformulating them into smooth problems with constraints or by dealing with the non-smooth objective directly. We focus on verified enclosures of all globally optimal points of such problems. In smooth problems in branch and bound algorithms, interval Newton...

To speed up the reform of the entire economic system with a focus on the cities, we need to coordinate several sets of reforms in several areas. Among these, the reform of the pricing system is a natural major node of the reform that would have the effect of putting the economy in a reasonable...